ABSTRACT
This chapter begins with an introduction to transportation problem network analysis, which shows how different basic feasible solution methods can be used to solve transportation problems. We have demonstrated three methods to obtain basic feasible solution methods through examples. Next, two methods to obtain the optimum solutions for basic feasible solution methods are discussed through examples. Special cases for transportation problems are also presented. In the second part of this chapter, an assignment problem is discussed, which involves assigning people to tasks. The Hungarian method for solving assignment problems is presented. Various formulations for the problems are provided along with their solutions. All learning outcomes, solved examples, and questions are mapped with Bloom’s Taxonomy levels (BT levels 1–6).
