The simplex method is not always well behaved

This publication has 13 references indexed in Scilit:

• On practical stopping rules for the simplex method
  Published by Springer Nature ,1987
• A mathematical programming updating method using modified Givens transformations and applied to LP problems
  Communications of the ACM, 1979
• A practicable steepest-edge simplex algorithm
  Mathematical Programming, 1977
• Iterative refinement implies numerical stability
  BIT Numerical Mathematics, 1977
• Methods for modifying matrix factorizations
  Mathematics of Computation, 1974
• Pivot selection methods of the Devex LP code
  Mathematical Programming, 1973
• A numerically stable form of the simplex algorithm
  Linear Algebra and its Applications, 1973
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
  Mathematical Programming, 1972
• A stabilization of the simplex method
  Numerische Mathematik, 1971
• The simplex method of linear programming using LU decomposition
  Communications of the ACM, 1969