Q. Solve the linear programming problem: max subject to constraints:
Solution:
We have, max Subject to constraints, On taking given constraints as equation, we get The following graph.
Here, OAB is the required feasible region whose comer points are and .
Comer point
at
at
at
Hence, maximum value of Z is which is obtained at
