Pratidin
2026 · Statistics Optional Paper II · 10 marksMainsQuestion 4bii

Use Vogel’s approximation method to solve the following transportation problem :
Distribution Centre
Plant | D₁ | D₂ | D₃ | D₄ | Capacity
P₁ | 2 | 3 | 11 | 7 | 6
P₂ | 1 | 0 | 6 | 1 | 1
P₃ | 5 | 8 | 15 | 9 | 10
Demand | 7 | 5 | 3 | 2

10 marks · directive: Solve

Answer

The core of a good answer

The problem is balanced (supply 17 = demand 17); Vogel's method gives the initial solution P₁D₁ = 1, P₁D₂ = 5, P₂D₄ = 1, P₃D₁ = 6, P₃D₃ = 3, P₃D₄ = 1 with cost 102, and two MODI improvements lead to the optimum P₁D₂ = 5, P₁D₃ = 1, P₂D₃ = 1, P₃D₁ = 7, P₃D₃ = 1, P₃D₄ = 2 with minimum cost 100.

An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work

What the question asks

Find the initial basic feasible solution by VAM (penalties = difference of the two smallest costs in each row and column; allocate in the least-cost cell of the line with the largest penalty), then test it by MODI and improve to the optimum. Show the penalty steps and the final table.

Answer outline

Introduction

Supplies 6 + 1 + 10 = 17; demands 7 + 5 + 3 + 2 = 17: balanced, so m + n − 1 = 6 basic cells are needed.

Step 1: VAM allocations

Step 2: MODI test of the VAM solution

Step 3: First improvement

Step 4: Second improvement

Conclusion

VAM gives a starting cost of 102, within 2% of the optimum; the optimal shipping plan costs 100. All steps were recomputed in Python and the optimum confirmed by a linear programming solver.

Examples and data to cite

Facts

Facts to remember

Sources used for the explanation

Write a timed answer in the app