On practical stopping rules for the simplex method

DOI10.1007/BFb0121186zbMath0636.90057OpenAlexW2185826091MaRDI QIDQ3777794

Włodzimierz 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

simplex algorithmround-off errorserror analysis techniquesfeasibility toleranceslexicographic LP problems

Mathematics Subject Classification ID

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

Related Items

The simplex method is not always well behaved, A practical anti-cycling procedure for linearly constrained optimization