A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone

This paper re-examines use of the linear programming (LP) formulation to solve the transportation problem (TP). The proposed method is a general-purpose algorithm which uses only one operation, the Gauss Jordan pivoting used in the simplex method. The final tableau can be used for post-optimality analysis of TP. This algorithm appears to be faster than simplex, more general than stepping-stone and simpler than both in solving general TP. A numerical example illustrates the methodology. It is assumed the reader is familiar with simplex terminology.