On the Numerical Stability of Simplex-Algorithms

DOI10.1080/02331938708843246zbMath0631.90037OpenAlexW2013801850MaRDI QIDQ3768670

No author found.

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843246

zbMATH Keywords

numerical stabilityorthogonal decompositionrevised simplex methodStability of update-formulae

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (1)

Some concepts of stability analysis in combinatorial optimization

Cites Work

• On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations
• A stabilization of the simplex method
• A numerically stable form of the simplex algorithm
• An implementation of a discretization method for semi-infinite programming
• The simplex method of linear programming using LU decomposition

This page was built for publication: On the Numerical Stability of Simplex-Algorithms