← 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:

ABCDAvail
S1S_12116251311
S2S_21718142313
S3S_33227184119
Req610121543

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:

Max penalty = 10 at D. Smallest in D = 13 (at S1S_1). Allocate min(11,15)=11\min(11,15)=11 to (S1,D)(S_1,D).

S1S_1 exhausted. Remaining D demand = 15-11 = 4.

Updated table (drop S1S_1 row):

ABCDAvail
S2S_21718142313
S3S_33227184119
Req610124

Penalties:

Max = 18 at D. Smallest in D = 23 (at S2S_2). Allocate min(13,4)=4\min(13,4)=4 to (S2,D)(S_2,D).

D exhausted. Remaining S2S_2 avail = 13-4 = 9.

Updated table (drop D):

ABCAvail
S2S_21718149
S3S_332271819
Req61012

Penalties:

Max = 15 at A. Smallest in A = 17 (S2S_2). Allocate min(9,6)=6\min(9,6)=6 to (S2,A)(S_2,A).

A exhausted. Remaining S2S_2 = 9-6 = 3.

Updated table:

BCAvail
S2S_218143
S3S_3271819
Req1012

Penalties:

Max = 9 (tie at S3S_3, B). Pick B. Smallest in B = 18 (S2S_2). Allocate min(3,10)=3\min(3,10)=3 to (S2,B)(S_2,B).

S2S_2 exhausted. Remaining B = 10-3 = 7.

Updated table:

BCAvail
S3S_3271819
Req712

Only S3S_3 left. Allocate min(19,7)=7\min(19,7)=7 to (S3,B)(S_3,B), then min(12,12)=12\min(12,12)=12 to (S3,C)(S_3,C).

Step 2 — IBFS allocations and cost

ABCDTotal
S1S_1---1111
S2S_263-413
S3S_3-712-19
Total610121543

Cost = 11(13)+6(17)+3(18)+4(23)+7(27)+12(18)11(13)+6(17)+3(18)+4(23)+7(27)+12(18) =143+102+54+92+189+216=796=143+102+54+92+189+216=796.

Step 3 — MODI test for optimality

Let uiu_i = row potentials, vjv_j = column potentials. For occupied cells: ui+vj=ciju_i+v_j=c_{ij}.

Set u1=0u_1=0.

From (S1,D)=13(S_1,D)=13: u1+vD=13vD=13u_1+v_D=13\Rightarrow v_D=13. From (S2,D)=23(S_2,D)=23: u2+vD=23u2=10u_2+v_D=23\Rightarrow u_2=10. From (S2,A)=17(S_2,A)=17: u2+vA=17vA=7u_2+v_A=17\Rightarrow v_A=7. From (S2,B)=18(S_2,B)=18: u2+vB=18vB=8u_2+v_B=18\Rightarrow v_B=8. From (S3,B)=27(S_3,B)=27: u3+vB=27u3=19u_3+v_B=27\Rightarrow u_3=19. From (S3,C)=18(S_3,C)=18: u3+vC=18vC=1u_3+v_C=18\Rightarrow v_C=-1.

Row potentials: u1=0,u2=10,u3=19u_1=0, u_2=10, u_3=19. Column potentials: vA=7,vB=8,vC=1,vD=13v_A=7, v_B=8, v_C=-1, v_D=13.

For unoccupied cells, opportunity cost Δij=cij(ui+vj)\Delta_{ij}=c_{ij}-(u_i+v_j):

All Δij0\Delta_{ij}\ge 0IBFS 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.  \boxed{\;\text{Optimal allocations: }(S_1,D)=11,(S_2,A)=6,(S_2,B)=3,(S_2,D)=4,(S_3,B)=7,(S_3,C)=12;\;\text{Cost}=796.\;}
We post more of this — worked solutions, CSAT trap breakdowns, guide chapters — a few times a week on Telegram. Free, no sign-in. Join

This solution is part of the Maths Coverage Map — 13 years, mapped. Get the take-away PDF free.