9. Solve the following Linear Programming Problems graphically:
Subject to the constraints:
Show that the minimum of Z occurs at more than two points.
The region determined by constraints is as follows,
The corner points of the feasible region are
The value of these points at these corner points are :
The feasible region is unbounded, therefore 1 may or may not be the maximum value of Z.
For this, we draw and check whether resulting half plane has a point in common with a feasible region or not.
We can see the resulting feasible region has a common point with a feasible region.
Hence , Z =1 is not maximum value , Z has no maximum value.
Create Your Account