← 2023 Paper 2
UPSC 2023 Maths Optional Paper 2 Q1e — Step-by-Step Solution
10 marks · Section A
Graphical method · Linear Programming · asked 5× in 13 yrs · Read the full method →
Question
A person requires 24, 24 and 20 units of chemicals A,B and C respectively for his garden. Product P contains 2, 4 and 1 units of chemicals A,B and C respectively per jar and product Q contains 2, 1 and 5 units of chemicals A,B and C respectively per jar. If a jar of P costs ₹30 and a jar of Q costs ₹50, then how many jars of each should be purchased in order to minimize the cost and meet the requirements?
Technique
Two-variable LPP, graphical method — enumerate corner-point feasible solutions.
Solution
Formulation. Let x1= jars of P, x2= jars of Q. Minimize
Z=30x1+50x2
subject to
(A)(B)(C)2x1+2x2≥24⇔x1+x2≥12,4x1+x2≥24,x1+5x2≥20,x1,x2≥0.
This is a two-variable LPP — solve graphically by identifying vertices of the feasible region (an unbounded polygon in the first quadrant) and evaluating Z at each.
Step 1 — Find candidate vertices (pairwise intersections of boundary lines).
| Lines intersected | Solution | All other constraints? |
|---|
| A ∩ B: x1+x2=12,4x1+x2=24 | (4,8) | C: 4+40=44≥20 ✓ |
| A ∩ C: x1+x2=12,x1+5x2=20 | (10,2) | B: 40+2=42≥24 ✓ |
| B ∩ C: 4x1+x2=24,x1+5x2=20 | (100/19,56/19) | A: 156/19≈8.21<12 ✗ |
| A ∩ axes: (12,0),(0,12) | — | C and B fail respectively ✗ |
| B ∩ axes: (6,0),(0,24) | — | (6,0): A fails (6<12); (0,24): A ✓, C: 120≥20 ✓ |
| C ∩ axes: (20,0),(0,4) | — | (20,0): A ✓, B ✓; (0,4): A fails |
Feasible vertices: (4,8),(10,2),(0,24),(20,0).
Step 2 — Evaluate Z at each feasible vertex.
| Vertex | Z=30x1+50x2 |
|---|
| (4,8) | 120+400=520 |
| (10,2) | 300+100=400 |
| (0,24) | 0+1200=1200 |
| (20,0) | 600+0=600 |
Step 3 — Optimal solution.
Minimum is at (x1,x2)=(10,2) with Z=400.
Answer
Buy 10 jars of P and 2 jars of Q; minimum cost =₹400.