Read the following text and answer the following questions on the basis of the same: Let R be the feasible region (convex polygon) for a linear programming problem and let be the objective function. When has an optimal value (maximum or minimum), where the variables and are subject to constraints described by linear inequalities, this optimal value must occur at a corner points (vertex) of the feasible region.
- The corner points of the feasible region determined by the system of linear constraints are , . The objective function is
Compare the quantity in Column and Column .
| Column | Column |
|---|---|
| Maximum of | 325 |
-
What do you understand by optimal solution?
-
Solve the following LPP graphically:
Max.
subject to
OR
Draw the graph of given LPP and find the corner points of feasible region.
Minimize
Subject to constraints:


