| Article ID: | iaor19961388 |
| Country: | Netherlands |
| Volume: | 16 |
| Issue: | 3 |
| Start Page Number: | 121 |
| End Page Number: | 127 |
| Publication Date: | Oct 1994 |
| Journal: | Operations Research Letters |
| Authors: | Pardalos Panos M., Saunders Michael A., Chen Hsin-Der |
The authors present a simplex-type algorithm for linear programming that works with primal-feasible and dual-feasible points associated with bases that differ by only one column. The algorithm is almost unaffected by degeneracy, and a preliminary implementation compares favorably with the primal simplex method.