Trilekha › CMA Final › P16 › 7 Transportation › 7.0
7.0 Transportation
76 lectures (76 with exact minutes) · 3 past exam questions · about 2.7 marks per exam · tier B for Dec 2026
Transportation problems minimize shipping costs from sources to destinations subject to supply, demand, and Rim Condition constraints using Linear Programming Formulations. Initial basic feasible solutions are established through the North West Corner Method (NWCM), Least Cost Method (LCM), or Vogel’s Approximation Method (VAM), and evaluated for optimality via the Modified Distribution (MODI) and Stepping Stone methods. Structured around numerical illustrations, the content addresses special cases including unbalanced problems with dummy entities, profit maximization via relative loss matrices, degeneracy resolved with epsilon, multiple optimal solutions, and prohibited routes assigned high costs.