The region is bounded, so the maximum of Z occurs at a corner point. It occurs at B exactly when Z(B) is at least the value of Z at every other corner.
Given: corners O(0,0), A(8,0), B(6,3), C(0,6) and Z=kx+y with k>0.
To find: the range of k for which the maximum is at B, and when B is the only optimal point.
Step 1 — Values at the corners.
| Corner point | Z=kx+y |
|---|
| O(0,0) | 0 |
| A(8,0) | 8k |
| B(6,3) | 6k+3 |
| C(0,6) | 6 |
Step 2 — Compare B with the other corners.
- B against A: 6k+3≥8k⟺k≤23.
- B against C: 6k+3≥6⟺k≥21.
- B against O: 6k+3≥0 holds for every k>0.
Step 3 — Uniqueness and the end values. When both comparisons are strict, 21<k<23, Z(B) is larger than at every other corner, so B is the only optimal point.
- At k=21: Z(B)=Z(C)=6. Here Z=21(x+2y) is parallel to the edge x+2y=12, so every point of segment BC is optimal.
- At k=23: Z(B)=Z(A)=12. Here Z=21(3x+2y) is parallel to the edge 3x+2y=24, so every point of segment AB is optimal.
Answer: (i) 21≤k≤23. (ii) B is the only optimal point for 21<k<23. At k=21 the maximum 6 is attained on all of BC, and at k=23 the maximum 12 is attained on all of AB.
Note: For k>23 the maximum moves to A, and for 0<k<21 it moves to C.