Q27: Maximise graphically: an unbounded region
Solve the following linear programming problem graphically :
Maximise
Subject to the constraints :
,
Draw the lines (graph below):
through and ;
through and .
Why?
Each constraint is bounded by a straight line: write it with "" in place of the inequality sign, and plot two points of it.
For : gives , and gives .
For : gives , and gives .
At the test point : and are true, so shade the side of each line that contains . With , the feasible region is the shaded region. It is unbounded.
Why?
A point that is not on a line tells us which side of the line to keep. At : , which is , and , which is . Both are true, so keep the side containing for both lines.
, keep only the first quadrant. The region is unbounded: every point with satisfies all four constraints, however large is.
At A, putting in : , so and .
Why?
The corner A is where the two lines meet, so solve their equations together. From , ; substitute in the other equation.
The other corner is the origin , where meets the -axis.
Why?
Corner point method: work out at every corner of the feasible region. For a bounded region, the largest of these values is the maximum.
Here the region is unbounded, so is only a candidate. It must be checked before we can call it the maximum.
The region is unbounded, so draw the half-plane (above the dashed line). It has points in common with the feasible region, for example , where .
Why?
The rule for an unbounded region: is the maximum only if the open half-plane has no point in common with the feasible region.
is feasible: , , and . It gives , more than . In fact at , so grows without limit.
Watch out: do not write "maximum " just because is the largest corner value.
has no maximum value.
Chapter 12, Linear Programming: LPP: unbounded region, no maximum.
Question type: An unbounded region with no maximum
How to spot it: click to see
Type 5. An unbounded region with no maximum
Spot it: the region goes on for ever, and keeps growing as you move out into it.
Here: The region is unbounded and the table gives at . But is in the region, on the side , with , so has no maximum value.
Tell us if something on this page is wrong or unclear. Send feedback on this question →
Linear Programming in past papers: question 6 of 27 · see them all