An Improved Tabular Technique for Presenting the Various Algorithms for Finding Initial Basic Feasible Solutions to Transportation Problems

Abstract

The special structure of the transportation problem allows securing a non-artificial starting basic solution using one of the three methods: Northwest-corner Method, Least-cost Method and Vogel Approximation Method. The difference among the three methods is the “quality” of the starting basic solution they produce, in the sense that a good starting solution yields an optimal solution in a fewer number of iterations. In general, the Vogel Approximation Method yields the best starting basic solution, and the Northwest-corner Method yields the worst. However, the Northwest-corner Method involves the least computations. Extensive and critical examination regarding the usage and improvement of these methods abound in several publications with trivial consideration given to the development of a near-ideal technique for presenting these algorithms. This paper develops and implements an all-encompassing tabular technique for presenting the algorithms for these three methods.

Keywords: Transportation problem, Improved Tabular Technique, Initial Basic Feasible Solution