Q. The minimum and maximum values of for the problem,
minimise and maximise ...(i)
subject to the constraints
...(ii)
...(iii)
...(iv)
...(v)
are respectively

 153  176 Linear Programming Report Error

Solution:

Given that,
Minimise and Maximise ...(i)
Subject to the constraints are
...(ii)
...(iii)
...(iv)
...(v)
First of all, let us graph the feasible region of the system of linear inequalities (ii) to . The feasible region is shown in the figure. Note that the region is bounded. The coordinates of the corner points and are , and , respectively.
image
We, now find the minimum and maximum value of . From the table, we find that the minimum value of is 60 at the point of the feasible region.
The maximum value of on the feasible region occurs at the two corner points and and it is 180 in each case.
Remark Observe that in the above example, the problem has multiple optimal solutions at the corner points and , i.e., the both points produce same maximum value 180 . In such cases, you can see that every point on the line segment joining the two corner points and also give the same maximum value. Same is also true in the case, if the two points produce same minimum value.