Making progress during a stall in the simplex algorithm

DOI10.1016/0024-3795(89)90464-3zbMath0666.65043OpenAlexW2005050903MaRDI QIDQ1116654

George B. Dantzig

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90464-3

zbMATH Keywords

linear programmingdegeneracysimplex methodrandom numberspivoting ruleComputational tests

Mathematics Subject Classification ID

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

Related Items

A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints, A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, A computationally stable solution algorithm for linear programs, An artificial-free simplex-type algorithm for general LP models, Applications of the parametric programming procedure, Systematic construction of examples for cycling in the simplex method, A practical anti-cycling procedure for linearly constrained optimization, Selected bibliography on degeneracy, Encounters with degeneracy: A personal view

Uses Software

• MINOS

Cites Work

• Unnamed Item
• The Influence of Computer Language on Computational Comparisons: An Example from Network Optimization
• New Finite Pivoting Rules for the Simplex Method
• A Technique for Resolving Degeneracy in Linear Programming
• On the basic theorem of complementarity