On practical stopping rules for the simplex method

DOI10.1007/BFB0121186MaRDI QIDQ3777794zbMATH OpenOpenAlexFDO

Authors W. Ogryczak

Publication date 1987

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0121186

zbMATH Keywords

error analysis techniquesfeasibility toleranceslexicographic LP problemsround-off errorssimplex algorithm

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• The simplex method is not always well behaved
• Publication:3479462
• Computational aspects of linear programming simplex method
• Practical finite pivoting rules for the simplex method
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming

Cited in

(3)

• New stopping criteria for detecting infeasibility in conic optimization
• The simplex method is not always well behaved
• A practical anti-cycling procedure for linearly constrained optimization

This page was built for publication: On practical stopping rules for the simplex method

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