For a bounded feasible region, Z=ax+by has both a maximum and a minimum, and each occurs at a corner point (Theorem 2).
Given: the constraints above. To find: Zmin and Zmax.
Step 1 — Shade each constraint.
- 2x+y≥8: the origin gives 0≥8, which is false, so the region is the side of the line away from the origin.
- x+y≤10: the side containing the origin.
- y≤2x: the line y=2x passes through the origin, so test another point instead. For (1,0), 0≤2 is true, so the region is the side below the line, towards the x-axis.
Step 2 — Corner points. The feasible region is the bounded quadrilateral ABCD.
- A: 2x+y=8 meets y=0 at (4,0).
- B: x+y=10 meets y=0 at (10,0).
- C: x+y=10 and y=2x give 3x=10, so C(310,320).
- D: 2x+y=8 and y=2x give 4x=8, so D(2,4).

Step 3 — Evaluate Z.
| Corner point | Z=x+3y |
|---|
| A(4,0) | 4 (minimum) |
| B(10,0) | 10 |
| C(310,320) | 310+20=370 (maximum) |
| D(2,4) | 14 |
Answer: Zmin=4 at (4,0) and Zmax=370 at (310,320).
Note: The origin is not feasible here, so Z=0 is not the minimum. A corner point need not have whole-number coordinates.