A note on cycling in the simplex method
From MaRDI portal
Publication:5556181
DOI10.1002/nav.3800160110zbMath0169.22002OpenAlexW2146657468MaRDI QIDQ5556181
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
Related Items
Cycling in linear programming problems ⋮ Systematic construction of examples for cycling in the simplex method ⋮ Least-index resolution of degeneracy in quadratic programming ⋮ Some NP-complete problems in linear programming ⋮ On cycling in the network simplex method ⋮ 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
This page was built for publication: A note on cycling in the simplex method
