On the Numerical Stability of Simplex-Algorithms
From MaRDI portal
Publication:3768670
Recommendations
- The simplex method is not always well behaved
- Amélioration de la stabilité numérique d'algorithmes de résolution de programmes linéaires à matrices de contraintes clairsemées
- Publication:3479462
- Stabilization of interior-point methods for linear programming
- scientific article; zbMATH DE number 988716
Cites work
- A numerically stable form of the simplex algorithm
- A stabilization of the simplex method
- An implementation of a discretization method for semi-infinite programming
- On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations
- The simplex method of linear programming using LU decomposition
Cited in
(8)- scientific article; zbMATH DE number 7307480 (Why is no real title available?)
- A numerically exact implementation of the simplex method
- A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
- Amélioration de la stabilité numérique d'algorithmes de résolution de programmes linéaires à matrices de contraintes clairsemées
- On the stability of a two-sided sweep algorithm
- Some concepts of stability analysis in combinatorial optimization
- scientific article; zbMATH DE number 4149472 (Why is no real title available?)
- scientific article; zbMATH DE number 433000 (Why is no real title available?)
This page was built for publication: On the Numerical Stability of Simplex-Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768670)
