(a) Iron: 3x+y≥12. Calcium: x+2y≥14.
Minimise Z=40x+30y subject to
3x+y≥12,x+2y≥14,x≥0,y≥0
(b) Solve 3x+y=12 and x+2y=14. From the first, y=12−3x; then x+24−6x=14, so x=2, y=6.
The line 3x+y=12 meets the y-axis at (0,12); there x+2y=24≥14, so it is feasible. The line x+2y=14 meets the x-axis at (14,0); there 3x+y=42≥12, so it is feasible.
Corner points: A(0,12), B(2,6), C(14,0). Both constraints are of the "≥" type, so the region lies on the far side of both lines from the origin and is unbounded.

(c) Values of Z at the corners:
| Corner | Z=40x+30y (₹) |
|---|
| A(0,12) | 360 |
| B(2,6) | 260 |
| C(14,0) | 560 |
The smallest corner value is 260. Since the region is unbounded, test the open half-plane 40x+30y<260, that is 4x+3y<26. Adding the two constraints gives, for every feasible point,
4x+3y=(3x+y)+(x+2y)≥12+14=26
so the half-plane has no point in common with the region. The minimum cost is ₹260, with 2 packs of P and 6 packs of Q.
(d) No. The largest corner value is 560. The open half-plane 40x+30y>560 contains (20,0), which is feasible (60≥12, 20≥14) and costs ₹800. The half-plane meets the region, so Z has no maximum; the cost can be made as large as we like by using more packs.
(e) With y=0 the constraints become 3x≥12 and x≥14, so x≥14. The cheapest choice is x=14 packs of P, costing 40×14= ₹560. This is the corner C, and it costs 560−260= ₹300 more than the minimum. (Calcium is the binding requirement: P alone supplies only 1 unit per pack, so 14 packs are needed even though 4 would cover the iron.)