Article ID: | iaor1989337 |
Country: | United Kingdom |
Volume: | 40 |
Issue: | 6 |
Start Page Number: | 581 |
End Page Number: | 590 |
Publication Date: | Jun 1989 |
Journal: | Journal of the Operational Research Society |
Authors: | Arsham H., Kahn A.B. |
This paper re-examines use of the linear programming 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.