A note on cycling in the simplex method

DOI10.1002/NAV.3800160110MaRDI QIDQ5556181zbMATH OpenOpenAlexFDO

Authors Kneale T. Marshall, J. W. Suurballe

Publication date 1969

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800160110

zbMATH Keywords

operations research

Cited in

(9)

• Selected bibliography on degeneracy
• Degeneracy graphs: Theory and applications. An updated survey
• Degeneracy in linear complementarity problems: A survey
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• Cycling in linear programming problems
• Some NP-complete problems in linear programming
• Systematic construction of examples for cycling in the simplex method
• On cycling in the network simplex method
• Least-index resolution of degeneracy in quadratic programming

This page was built for publication: A note on cycling in the simplex method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5556181)