← 2022 Paper 2
UPSC 2022 Maths Optional Paper 2 Q4c — Step-by-Step Solution
20 marks · Section A
Transportation problem · Linear Programming · asked 5× in 13 yrs · Read the full method →
Question
Find IBFS by Vogel’s method and optimal solution by MODI:
| A | B | C | D | Avail |
|---|
| S1 | 21 | 16 | 25 | 13 | 11 |
| S2 | 17 | 18 | 14 | 23 | 13 |
| S3 | 32 | 27 | 18 | 41 | 19 |
| Req | 6 | 10 | 12 | 15 | 43 |
Total avail = 11+13+19 = 43 = Total req. Balanced.
Technique
VAM for initial BFS (penalty-based row/column selection); MODI test using row/column potentials; opportunity costs nonnegative ⇒ optimal.
Solution
Step 1 — VAM (Vogel’s Approximation Method)
For each row/column, compute the penalty = difference between two smallest costs.
Initial penalties:
- S1: 13, 16 → penalty = 3.
- S2: 14, 17 → penalty = 3.
- S3: 18, 27 → penalty = 9.
- A: 17, 21 → 4.
- B: 16, 18 → 2.
- C: 14, 18 → 4.
- D: 13, 23 → 10.
Max penalty = 10 at D. Smallest in D = 13 (at S1). Allocate min(11,15)=11 to (S1,D).
S1 exhausted. Remaining D demand = 15-11 = 4.
Updated table (drop S1 row):
| A | B | C | D | Avail |
|---|
| S2 | 17 | 18 | 14 | 23 | 13 |
| S3 | 32 | 27 | 18 | 41 | 19 |
| Req | 6 | 10 | 12 | 4 | |
Penalties:
- S2: 14, 17 → 3.
- S3: 18, 27 → 9.
- A: 17, 32 → 15.
- B: 18, 27 → 9.
- C: 14, 18 → 4.
- D: 23, 41 → 18.
Max = 18 at D. Smallest in D = 23 (at S2). Allocate min(13,4)=4 to (S2,D).
D exhausted. Remaining S2 avail = 13-4 = 9.
Updated table (drop D):
| A | B | C | Avail |
|---|
| S2 | 17 | 18 | 14 | 9 |
| S3 | 32 | 27 | 18 | 19 |
| Req | 6 | 10 | 12 | |
Penalties:
- S2: 14, 17 → 3.
- S3: 18, 27 → 9.
- A: 17, 32 → 15.
- B: 18, 27 → 9.
- C: 14, 18 → 4.
Max = 15 at A. Smallest in A = 17 (S2). Allocate min(9,6)=6 to (S2,A).
A exhausted. Remaining S2 = 9-6 = 3.
Updated table:
| B | C | Avail |
|---|
| S2 | 18 | 14 | 3 |
| S3 | 27 | 18 | 19 |
| Req | 10 | 12 | |
Penalties:
- S2: 14, 18 → 4.
- S3: 18, 27 → 9.
- B: 18, 27 → 9.
- C: 14, 18 → 4.
Max = 9 (tie at S3, B). Pick B. Smallest in B = 18 (S2). Allocate min(3,10)=3 to (S2,B).
S2 exhausted. Remaining B = 10-3 = 7.
Updated table:
| B | C | Avail |
|---|
| S3 | 27 | 18 | 19 |
| Req | 7 | 12 | |
Only S3 left. Allocate min(19,7)=7 to (S3,B), then min(12,12)=12 to (S3,C).
Step 2 — IBFS allocations and cost
| A | B | C | D | Total |
|---|
| S1 | - | - | - | 11 | 11 |
| S2 | 6 | 3 | - | 4 | 13 |
| S3 | - | 7 | 12 | - | 19 |
| Total | 6 | 10 | 12 | 15 | 43 |
Cost = 11(13)+6(17)+3(18)+4(23)+7(27)+12(18)
=143+102+54+92+189+216=796.
Step 3 — MODI test for optimality
Let ui = row potentials, vj = column potentials. For occupied cells: ui+vj=cij.
Set u1=0.
From (S1,D)=13: u1+vD=13⇒vD=13.
From (S2,D)=23: u2+vD=23⇒u2=10.
From (S2,A)=17: u2+vA=17⇒vA=7.
From (S2,B)=18: u2+vB=18⇒vB=8.
From (S3,B)=27: u3+vB=27⇒u3=19.
From (S3,C)=18: u3+vC=18⇒vC=−1.
Row potentials: u1=0,u2=10,u3=19.
Column potentials: vA=7,vB=8,vC=−1,vD=13.
For unoccupied cells, opportunity cost Δij=cij−(ui+vj):
- (S1,A): 21−(0+7)=14.
- (S1,B): 16−(0+8)=8.
- (S1,C): 25−(0+(−1))=26.
- (S2,C): 14−(10+(−1))=5.
- (S3,A): 32−(19+7)=6.
- (S3,D): 41−(19+13)=9.
All Δij≥0 ⇒ IBFS is optimal.
Answer
Optimal allocations: (S1,D)=11,(S2,A)=6,(S2,B)=3,(S2,D)=4,(S3,B)=7,(S3,C)=12;Cost=796.