Solve the following linear programming problem graphically:
Minimise subject to
Does have a maximum value on the feasible region? Give a reason.
Confirming your payment
Practice Questions · Question 23 of 30
Solve the following linear programming problem graphically:
Minimise subject to
Does have a maximum value on the feasible region? Give a reason.
If the feasible region is unbounded, the smallest corner value is the minimum of only when the open half plane has no point in common with the region. Likewise, the largest corner value is the maximum only when has no common point.
Given: the constraints above. To find: , and whether exists.
Step 1 — Corner points. The region lies above both lines and and below . It is open to the right, so it is unbounded.
The points and are not corners: the first breaks , the second breaks .
Step 2 — Evaluate .
| Corner point | |
|---|---|
| (smallest) | |
Step 3 — Test the minimum. Draw the line through , shown dashed in the figure. The whole region lies on the side . Algebraically, for every feasible point,
So the half plane has no point in common with the region, and is the minimum.

Step 4 — Maximum. The largest corner value is . But is feasible (, , ) and gives . So the half plane meets the region, and has no maximum. Moving further right along the -axis makes as large as we like.
Answer: at . has no maximum, because the region is unbounded in a direction along which keeps increasing.