ON FINDING AN INITIAL SOLUTION FOR THE DUAL SIMPLEX ALGORITHM

Torrance [4] has proposed a “new” approach to finding an initial solution of a linear programming problem for use in conjunction with the dual simplex algorithm. The purpose of this note is to comment on two aspects of that paper. Firstly, Torrance's method is not new at all, but was proposed in 1958 by Wagner. Secondly, the method can be implemented much more efficiently than Torrance suggests.