Introduction:
Linear inequalities are used to prescribe limitations or restrictions on allocation of available resources (material, capital, machine capabilities, labour hours, land etc.). In this chapter, our main goal will be to optimize (maximize or minimize) a quantity under consideration subject to certain restrictions.
Linear Inequalities:
Inequalities are expressed by the following four symbols;
> (greater than); < (less than); ≥ (greater than or equal to); ≤ (less than or equal to)
Linear Programming:
A function which is to be maximized or minimized is called an objective function. Note that there are infinitely many feasible solutions in the feasible region. The feasible solution which maximizes or minimizes the objective function is called the optimal solution. The theorem of linear programming states the maximum and minimum values of the objective function occur at corner points of the feasible region.
Linear inequalities are used to prescribe limitations or restrictions on allocation of available resources (material, capital, machine capabilities, labour hours, land etc.). In this chapter, our main goal will be to optimize (maximize or minimize) a quantity under consideration subject to certain restrictions.
Linear Inequalities:
Inequalities are expressed by the following four symbols;
> (greater than); < (less than); ≥ (greater than or equal to); ≤ (less than or equal to)
Linear Programming:
A function which is to be maximized or minimized is called an objective function. Note that there are infinitely many feasible solutions in the feasible region. The feasible solution which maximizes or minimizes the objective function is called the optimal solution. The theorem of linear programming states the maximum and minimum values of the objective function occur at corner points of the feasible region.
Comments
Post a Comment