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.