The simplex method is not always well behaved

DOI10.1016/0024-3795(88)90197-8zbMATH Open0655.65082OpenAlexW2044280049MaRDI QIDQ1109528FDOQ1109528

Authors: W. Ogryczak 

Publication date: 1988

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(88)90197-8

Recommendations

• The complexity of the simplex method
• scientific article; zbMATH DE number 653033
• scientific article; zbMATH DE number 3852781
• The simplex method and unrestricted variables
• Small degenerate simplices can be bad for simplex methods
• Publication:4502371
• Several modifications of simplex method
• Some notes on the nonlinear simplex method
• scientific article; zbMATH DE number 3188915

zbMATH Keywords

sensitivitynumerical stabilitysimplex methodrounding-error analysisBartels-Golub algorithmlinear- programming

Mathematics Subject Classification ID

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

Cites Work

• Methods for Modifying Matrix Factorizations
• Pivot selection methods of the Devex LP code
• Title not available (Why is that?)
• A Characterization of Stability in Linear Programming
• Title not available (Why is that?)
• A practicable steepest-edge simplex algorithm
• A stabilization of the simplex method
• The simplex method of linear programming using LU decomposition
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• A numerically stable form of the simplex algorithm
• Methods for Computing and Modifying the LDV Factors of a Matrix
• Iterative refinement implies numerical stability
• On practical stopping rules for the simplex method
• Numerical stability of the Chebyshev method for the solution of large linear systems
• A mathematical programming updating method using modified Givens transformations and applied to LP problems

Cited In (5)

• On the Numerical Stability of Simplex-Algorithms
• On practical stopping rules for the simplex method
• Round-off estimates for second-order conic feasibility problems
• Title not available (Why is that?)
• Solving linear programs with finite precision. II: Algorithms

Uses Software

• DEVEX

This page was built for publication: The simplex method is not always well behaved

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