The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling

Mathematical Programming

Volumn 100, Issue 1, 2004, Pages 133-150

  Hall, J A J ^a   McKinnon, K I M ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Cycling; Degeneracy; EXPAND; Linear programming; Simplex method

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; HEURISTIC METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING;

CYCLING; DEGENERACY; EXPAND; SIMPLEX METHODS;

LINEAR PROGRAMMING;

EID: 21044438928     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0488-1     Document Type: Review

References (16)

1. Balinski, M.L., Gomory, R.E.: A mutual primal-dual simplex method. In: R.L. Graves, P. Wolfe, (eds.), Recent Advances in Mathematical programming. McGraw-Hill, New York, 1963
2. Beale, E.M.L.: Cycling in the dual simplex algorithm. Naval Res. Logistics Quarterly 2, 269-75 (1955)
3. Fletcher, R.: Degeneracy in the presence of roundoff errors. Linear Algebra and its Appl. 106, 149-183 (1988)
4. Fletcher, R.: Resolving degeneracy in quadratic programming. Ann. Oper. Res.: degeneracy in optim. problem 47, 307-334 (1993)
5. Fletcher R., Hall, J.A.J.: Towards reliable linear programming. In: G.A. Watson and D.F. Griffiths, (eds.), Pitman Research Notes in Mathematics Series 228, Longman Scientific and Technical, 1990, pp. 89-104
6. Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: A practical anti-cycling procedure for linearly constrained optimization. Math. Prog. 45, 437-474 (1989)
7. Goldfarb, D., Reid, J.K.: A practical steepest-edge simplex algorithm. Math. Prog. 12, 361-371 (1977)
8. Hall, J.A.J., McKinnon, K.I.M.: Hyper-sparsity in the revised simplex method and how to exploit it. Technical Report MS00-015, Department of Mathematics and Statistics, University of Edinburgh, 2000. Submitted to SIAM Journal of Optimization
9. Hall, J.A.J., McKinnon, K.I.M.: LP test problems. http://www.maths.ed.ac.uk/hall/PublicLP/, 2002
10. Harris, P.M.J.: Pivot selection methods of the Devex LP code. Math. Prog. 5, 1-28 (1973);
11. [Reprinted in Math. Prog. Study 2, 30-57 (1975)].
12. IBM. Optimization Subroutine Library, guide and reference, release 2, 1993
13. ILOG. CPLEX 6.5 Reference Manual, 1999
14. Murtagh, B.A., Saunders, M.A.: MINOS 5.4 user's guide. Technical Report SOL 83-20R, Stanford University, Systems Optimization Laboratory, December 1983 1993. (revised February 1995)
15. Wolfe, P.: A technique for resolving degeneracy in linear programming. SIAM J. Appl. Math. 11, 205-211 (1963)
16. Wunderling, R., Bley, A., Pfender, T., Koch, T.: SOPLEX 1.2.0, 2002