Q11: Where is minimum on an unbounded region
The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function occurs at
(a) only
(b) only
(c) and only
(d) at every point of the line-segment joining the points and
Values of at the corner points:
Why?
The corner point method: if Z has a minimum on the feasible region, it occurs at a corner point. So we first evaluate Z at every corner.
At : and .
Put each corner into :
The smallest value is 12, at the two adjacent corners and . The region is unbounded, so check the half-plane , that is .
Why?
On an unbounded region the smallest corner value need not be the minimum. It is the minimum only if the open half-plane has no point in common with the region.
Dividing by 2 gives the simpler .
The boundary through and is the line , and the region lies on the side . So has no point in common with the region.
Why?
Both corners lie on :
The origin gives , and the origin is outside the shaded region. So the region is on the other side, where .
So the minimum value 12 occurs at every point of the segment joining and .
Why?
The line , that is , is the same line as the edge . So Z equals 12 all along that edge, not just at its ends. For example, at the midpoint :
That is why options (a), (b) and (c), which say "only", are wrong.
Answer: (d) at every point of the line-segment joining the points and
Chapter 12, Linear Programming: LPP: minimum on an unbounded feasible region.
Question type: An unbounded region + Both maximum and minimum, and a tie along an edge (combines 2 types)
How to spot it: click to see
Type 4. An unbounded region: check the minimum with a half-plane
Spot it: all the rules are "", so the shaded region goes on for ever. The question asks for a minimum.
Here: The region is unbounded and the table gives . The open half-plane lies below the boundary , so it has no point in the region, and 12 is the minimum.
Type 3. Both maximum and minimum, and a tie along an edge
Spot it: "Minimise and maximise ". Often one rule, like , is a line through the origin.
Here: The value 12 comes at two corners, and , so every point of the segment joining them gives it too: option (d).
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 25 of 27 · see them all