(a) Pitches: x+y≤9. Budget: 2000x+5000y≤30000, that is 2x+5y≤30. Also x≥0, y≥0.
(b) Maximise the number of places S=10x+20y. Corners of the region: (0,0), (9,0), (0,6), and the meeting point of x+y=9 and 2x+5y=30: 2x+5(9−x)=30 gives x=5, y=4.
| Corner | S=10x+20y |
|---|
| (0,0) | 0 |
| (9,0) | 90 |
| (5,4) | 130 |
| (0,6) | 120 |
The region is bounded, so at most 130 students can be accommodated, using 5 small tents and 4 large tents.
(c) Sleeping 150 students needs 10x+20y≥150. But every plan that satisfies the pitch and budget constraints has 10x+20y≤130<150. So no point satisfies all the constraints together: the feasible region is empty, and the problem has no feasible solution unless a condition is relaxed.
(d) Places: 10x+20y≥120, that is x+2y≥12. The region is now
x+y≤9,2x+5y≤30,x+2y≥12,x,y≥0
- x+2y=12 and 2x+5y=30: subtracting twice the first from the second gives y=6, x=0, so A(0,6).
- x+y=9 and 2x+5y=30: B(5,4), and 5+8=13≥12, feasible.
- x+2y=12 and x+y=9: subtracting gives y=3, x=6, so C(6,3); 12+15=27≤30, feasible.
The corner points are A(0,6), B(5,4) and C(6,3); the region is the small triangle ABC.

(e) Cost in thousands of rupees: Z=2x+5y.
Z(A)=30, Z(B)=10+20=30, Z(C)=12+15=27.
The region is bounded, so the cheapest plan is 6 small tents and 3 large tents, costing ₹27,000. It sleeps exactly 60+60=120 students and uses all 9 pitches.