� A few important linear programming problems are:
(i) Diet problems
(ii) Manufacturing problems
(iii) Transportation problems
� The common region determined by all the constraints including the non-negative
constraints x ≥ 0, y ≥ 0 of a linear programming problem is called the feasible
region (or solution region) for the problem � Points within and on the boundary of the feasible region represent feasible
solutions of the constraints Any point outside the feasible region is an infeasible solution © NCERT
not to be republished
LINEAR PROGRAMMING         529
� Any point in the feasible region that gives the optimal value (maximum or
minimum) of the objective function is called an optimal solution