Transportation and assignment problems are traditional examples of linear programming problems. Although these problems are solvable by using the techniques of Chapters 2-4 directly, the solution procedure is cumbersome; hence, we develop much more efficient algorithms for handling these problems. In the cases of transportation problems, the algorithm is essentially a disguised form of the dual simplex algorithm of 4&2. Assignment problems, which are special cases of transportation problems, pose difficulties for the transportation algorithm and require the development of an algorithm which takes advantage of the simpler nature of these problems.