A New Algorithm for Tree Modification in the Primal Transportation Problem

Primal methods for the transportation problem of linear programming require substantial bookkeeping to deal with constant updating of a tree describing the shipments in the current feasible solution. This paper suggests a new means of bookkeeping which is useful for long narrow problems. The method builds on previous work by the same author which reduces the number of records to be updated. The new methods reduce the number of items which have to be maintained for a replication of the tree and simplify some steps in updating the remaining items.