Making progress during a stall in the simplex algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- A Technique for Resolving Degeneracy in Linear Programming
- New Finite Pivoting Rules for the Simplex Method
- On the basic theorem of complementarity
- The Influence of Computer Language on Computational Comparisons: An Example from Network Optimization
Cited in
(11)- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- Parametric linear programming and anti-cycling pivoting rules
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- Systematic construction of examples for cycling in the simplex method
- scientific article; zbMATH DE number 4005973 (Why is no real title available?)
- Encounters with degeneracy: A personal view
- Applications of the parametric programming procedure
- A practical anti-cycling procedure for linearly constrained optimization
- Selected bibliography on degeneracy
- An artificial-free simplex-type algorithm for general LP models
- A computationally stable solution algorithm for linear programs
This page was built for publication: Making progress during a stall in the simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116654)