On an unbounded region, a corner value M is the maximum only if ax+by>M has no point in common with the region, and m is the minimum only if ax+by<m has none. On a bounded region, both always exist at corner points.
Given: the region R and the objective functions above. To find: the optima in (i), (ii) and (iii).
Step 1 — Corner points of R. x+y≥5 is the side away from the origin, and x−2y≤2 is the side containing the origin.
- x+y=5 meets x=0 at P(0,5). Check: 0−10≤2.
- x+y=5 and x−2y=2: subtracting gives 3y=3, so y=1 and x=4, giving Q(4,1).
The points (5,0) and (2,0) are not feasible: (5,0) breaks x−2y≤2, and (2,0) breaks x+y≥5. The region runs upwards and to the right without end, so R is unbounded, with corners P and Q only.

Step 2 — Part (i), Z1=3x+2y. Z1(P)=10 and Z1(Q)=14.
- Minimum: for every point of R, 3x+2y=2(x+y)+x≥2(5)+0=10. So 3x+2y<10 has no common point with R, and Z1,min=10 at (0,5).
- Maximum: (0,8) is in R and gives Z1=16>14. So Z1 has no maximum.
Step 3 — Part (ii), Z2=2x−5y. Z2(P)=−25 and Z2(Q)=3.
Maximum. On R, x≤2+2y. Also 5≤x+y≤2+3y, so y≥1. Hence
2x−5y≤2(2+2y)−5y=4−y≤4−1=3
So 2x−5y>3 has no common point with R, and Z2,max=3, attained only at (4,1) (equality needs y=1 and x=4).
Minimum. (0,6) is in R (since 6≥5 and −12≤2) and gives Z2=−30<−25. So Z2 has no minimum.
Step 4 — Part (iii). Adding x+y≤9 makes the region bounded, with corners (0,5), (4,1), (0,9) and the intersection of x+y=9 with x−2y=2. Subtracting gives 3y=7, so y=37 and x=320.
| Corner point | Z1=3x+2y |
|---|
| (0,5) | 10 |
| (4,1) | 14 |
| (320,37) | 20+314=374 (maximum) |
| (0,9) | 18 |
Answer: (i) The corners are (0,5) and (4,1). Z1,min=10 at (0,5), and Z1 has no maximum. (ii) Z2,max=3 at (4,1), and Z2 has no minimum. (iii) Z1,max=374 at (320,37).
Note: On the same unbounded region, one objective has only a minimum and another only a maximum. Whether an optimum exists depends on the objective, not just on the shape of the region.