Abstract
Instead of trying to recognize and avoid degenerate steps in the simplex method (as some variants do), we have developed a new Phase I algorithm that is impervious to degeneracy. The new algorithm solves a non-negative least-squares problem in order to find a Phase I solution. In each iteration, a simple two-variable least-squares subproblem is used to select an incoming column to augment a set of independent columns (called “basic”) to get a strictly better fit to the right-hand side. Although this is analogous in many ways to the simplex method, it can be proved that strict improvement is attained at each iteration, even in the presence of degeneracy. Thus cycling cannot occur, and convergence is guaranteed. This algorithm is closely related to a number of existing algorithms proposed for non-negative least-squares and quadratic programs.
When used on the 30 smallest NETLIB linear programming test problems, the computational results for the new Phase I algorithm were almost 3.5 times faster than a particular implementation of the simplex method; on some problems, it was over 10 times faster. Best results were generally seen on the more degenerate problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.J. Hoffman, Cycling in the Simplex algorithm, National Bureau of Standards, Report No. 2974 (1953).
E.M.L. Beale, Cycling in the dual Simplex algorithm, Naval Res. Logist. Quart. 2(4) (1955) 269–276.
Å. Björck, Least square methods, Working Paper, Department of Mathematics, Linköping University, S-581 83 Linköping, Sweden (1987).
C.L. Lawson and R.J. Hanson,Solving Least-Squares Problems (Prentice-Hall, 1974).
G.B. Dantzig,Linear Programming and Extension (Princeton University Press, 1963).
C. van de Panne and A. Whinston, The symmetric foundation of the simplex method for quadratic programming, Econometrica 37 (1969) 507–527.
P.E. Gill, S.J. Hammarling, W. Murray, M.A. Saunders and M.H. Wright, User's Guide for LSSOL, Report SOL 86-1, Department of Operations Research, Stanford University (1986).
S.A. Leichner, G.B. Dantzig and J.W. Davis, A strictly improving Phase I algorithm using least-squares subproblems, Report SOL 92-1, Department of Operations Research, Stanford University (1992).
D.M. Gay, Electronic mail distribution of linear programming test problems, Math. Progr. Soc. COAL Newsletter 13 (1985) 10–12.
D. Goldfarb and A. Idnani, A numerically stable dual method for solving strictly convex quadratic programs, Math. Prog. 27 (1983) 1–33.
I.J. Lustig, An analysis of an available set of linear programming test problems, Report SOL 87-11, Department of Operations Research, Stanford University (1987).
P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, 1981).
P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, A practical anti-cycling procedure for linearly constrained optimization, Math. Prog. 45 (1989) 437–474.
Å. Björck, Iterative refinement of linear least squares solutions, BIT 7 (1967) 257–278 and BIT 8 (1968) 8–30.
S.A. Leichner, G.B. Dantzig and J.W. Davis, A strictly improving linear programming algorithm using least-squares subproblems, Report SOL 92-2, Department of Operations Research, Stanford University (1992).
K.H. Borgwardt,The Simplex Method — A Probabilistic Approach (Springer, 1987).
J. Clausen, A new family of exponential LP problems, Eur. J. Oper. Res. 32 (1987) 130–139.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Leichner, S.A., Dantzig, G.B. & Davis, J.W. A strictly improving linear programming Phase I algorithm. Ann Oper Res 46, 409–430 (1993). https://doi.org/10.1007/BF02023107
Issue Date:
DOI: https://doi.org/10.1007/BF02023107