� 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 � The following Theorems are fundamental in solving linear programming
problems:
Theorem 1 Let R be the feasible region (convex polygon) for a linear
programming problem and let Z = ax + by be the objective function