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 When Z
has an optimal value (maximum or minimum), where the variables x and y
are subject to constraints described by linear inequalities, this optimal value
must occur at a corner point (vertex) of the feasible region