ABSTRACT
Integer programming is a large subarea of operations research in its own right. This chapter presents an algorithm called the transportation algorithm for the special integer programming problem. There are several locations, called sources, which are able to supply needed items to several other locations, called destinations, which require the items in some known quantities. The chapter shows how to solve a transportation problem. It explains how to analyze the sensitivity of the optimal solution to changes in problem parameters, without repeating the entire computation. Some new computing will be necessary, but it is less time consuming than to solve the problem again from scratch. The chapter discusses a technique for non-standard linear programming problems. It explains how to obtain a new optimal solution if the basic list becomes sub-optimal, or even infeasible.
