Solve the following linear programming problem graphically:
Maximise and minimise subject to
Confirming your payment
Practice Questions · Question 26 of 30
Solve the following linear programming problem graphically:
Maximise and minimise subject to
On an unbounded feasible region, the largest corner value is the maximum only if the open half plane has no point in common with the region. Similarly, the smallest corner value is the minimum only if has no common point.
Given: the constraints above. To find: and , if they exist.
Step 1 — Region and corner points. means , the side of that line containing the origin. is the side away from the origin. Together with , these give a region that 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 | |
|---|---|
| (largest, ) | |
| (smallest, ) |
Step 3 — Test the maximum. For any feasible point, , so . Using ,
So no point of the region lies in , and . Equality needs and , so the maximum occurs only at .

Step 4 — Test the minimum. Take . Here and , so it is feasible, and . The half plane meets the region, so has no minimum.
Answer: at . has no minimum value.
Note: An unbounded region does not rule out an optimum. Here the maximum exists because decreases in every direction in which the region extends.