Transportation Problems

  • Harvir Singh Kasana
  • Krishna Dev Kumar


The chapter starts with a description of a transportation problem and different heuristics to find the initial basic feasible solutions. In the next section, the procedure to find an optimal solution is explained. Section 7.3 is on the transportation through transshipment. In the end we introduce the Assignment problem, and the Hungarian algorithm to find its optimal solution.


Assignment Problem Transportation Problem Dual Variable Cost Matrix Optimal Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Harvir Singh Kasana
    • 1
  • Krishna Dev Kumar
    • 2
  1. 1.Department of MathematicsThapar Institute Engineering and TechnologyPatialaIndia
  2. 2.Department of Aerospace EngineeringKorea Advanced Institute of Science and TechnologyTaejonRepublic of Korea

Personalised recommendations