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.
KeywordsAssignment Problem Transportation Problem Dual Variable Cost Matrix Optimal Assignment
Unable to display preview. Download preview PDF.