On an unbounded feasible region, the smallest corner value m is the minimum of Z only if the open half plane Z<m has no point in common with the region.
Given: P carries 10 t cement and 2 t steel for ₹4,000; Q carries 4 t cement and 4 t steel for ₹2,500; at least 80 t cement and 48 t steel are needed; at most 15 Q-trips are available.
To find: the cheapest number of trips of each type, and whether the proposed plan works.
Step 1 — Formulate. Let x trips of type P and y trips of type Q be made.
- Cement: 10x+4y≥80, i.e. 5x+2y≥40.
- Steel: 2x+4y≥48, i.e. x+2y≥24.
- Availability: y≤15.
- x≥0, y≥0.
Minimise Z=4000x+2500y.
Step 2 — Corner points. The region lies above both lines 5x+2y=40 and x+2y=24 and below y=15. It is open to the right, so it is unbounded.
- 5x+2y=40 meets y=15 where 5x=10, at (2,15).
- 5x+2y=40 and x+2y=24: subtracting gives 4x=16, so x=4 and y=10, giving (4,10).
- x+2y=24 meets y=0 at (24,0).
The intercepts (8,0) and (0,12) are not feasible: each breaks one of the two supply constraints.

Step 3 — Evaluate Z.
| Corner point | Z=4000x+2500y |
|---|
| (2,15) | 45500 |
| (4,10) | 41000 (smallest) |
| (24,0) | 96000 |
Step 4 — Half-plane test. 4000x+2500y<41000 is the same as 8x+5y<82. For every feasible point,
8x+5y=811(5x+2y)+89(x+2y)≥811(40)+89(24)=55+27=82
So the open half plane has no point in common with the region, and ₹41,000 is the minimum cost.
Step 5 — Part (iii). For x=3, y=11: cement carried =10(3)+4(11)=74 t, which is less than 80 t. The plan breaks the cement constraint, so it is not feasible. A cost below the minimum ₹41,000 is possible only outside the feasible region, which is exactly why it fails.
Answer: (i) Minimise Z=4000x+2500y subject to 5x+2y≥40, x+2y≥24, y≤15, x,y≥0. (ii) Book 4 trips of type P and 10 trips of type Q, at a minimum cost of ₹41,000. (iii) No. It moves only 74 t of cement, short of the 80 t required.