(a) Mass: x+y≤20. Nutrient: 2x+y≥16. Airiness: x−y≤2. Also x≥0, y≥0.
Cost: Z=30x+20y rupees.
(b) Corners:
- 2x+y=16 with x=0: (0,16);
- 2x+y=16 with x−y=2: adding gives 3x=18, so (6,4); mass 10≤20, feasible;
- x−y=2 with x+y=20: (11,9); nutrient 31≥16, feasible;
- x+y=20 with x=0: (0,20).
(The point (8,0), where 2x+y=16 meets the x-axis, breaks x−y≤2, so it is not a corner.) The corner points are (0,16), (6,4), (11,9) and (0,20).
(c)
| Corner | Z=30x+20y (₹) |
|---|
| (0,16) | 320 |
| (6,4) | 260 |
| (11,9) | 510 |
| (0,20) | 400 |
The cheapest batch is 6 kg of compost with 4 kg of cocopeat, costing ₹260.
(d) The costliest batch is 11 kg of compost with 9 kg of cocopeat, costing ₹510. Such a batch must exist because the feasible region is bounded (it is the quadrilateral above), and a linear function on a bounded feasible region always has a maximum, attained at a corner point.
(e) Now x+y=20, so y=20−x and the cost is 30x+20(20−x)=400+10x. The other conditions on this line are 2x+(20−x)≥16, i.e. x≥−4 (always true), and x−(20−x)≤2, i.e. x≤11. So 0≤x≤11 along the edge from (0,20) to (11,9), and 400+10x is least at x=0. The cheapest 20 kg batch is 20 kg of cocopeat and no compost, costing ₹400 (it supplies 20≥16 units of nutrient).