An Extended Programming Experience

Abstract

The paper summarizes a twenty-year experience with the computational aspects of the transportation problem of linear programming. The problem is completely described and standard solution methods are summarized. The order bounds for these computations are examined. Attention then turns to some sample research problems, including shortening the search for a move, solving a condensed problem, choosing a starting basis, and several recently developed dual methods. Brief reference is made to the difficulties which arise in publishing unorthodox approaches such as those discussed in the paper.