Systematic construction of examples for cycling in the simplex method
From MaRDI portal
Publication:2489285
DOI10.1016/J.COR.2005.02.001zbMATH Open1086.90040OpenAlexW2124829012MaRDI QIDQ2489285FDOQ2489285
Authors: Peter Zörnig 
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.001
Recommendations
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
- Visualizing and Constructing Cycles in the Simplex Method
- Cycling in linear programming problems
- A note on cycling LP examples with permutation structure
- What is the worst case behavior of the simplex algorithm?
Cites Work
- The TOMLAB OPERA toolbox for linear and discrete optimization
- An integral simplex algorithm for solving combinatorial optimization problems
- A practical anti-cycling procedure for linearly constrained optimization
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
- An Algorithm for Large-Scale Quadratic Programming
- A practicable steepest-edge simplex algorithm
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- A new pivoting rule for solving various degeneracy problems
- Practical finite pivoting rules for the simplex method
- An exterior point simplex algorithm for (general) linear programming problems
- On cycling in the network simplex method
- Least-index resolution of degeneracy in quadratic programming
- The Convex Simplex Method
- Cycling in linear programming problems
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm
- Survey of solved and open problems in the degeneracy phenomenon
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- Degeneracy graphs and simplex cycling
- Classroom Note:Hoffman's Circle Untangled
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the bottleneck linear programming problem
- On anti-cycling pivoting rules for the simplex method
- Parametric linear programming and anti-cycling pivoting rules
- Making progress during a stall in the simplex algorithm
- Cycling in linear complementarity problems
- Cycling in the transportation problem
- A note on cycling in the simplex method
- Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule
Cited In (11)
- Parametric linear programming and anti-cycling pivoting rules
- A note on cycling LP examples with permutation structure
- On Hoffman's celebrated cycling LP example
- Title not available (Why is that?)
- Phase I cycling under the most-obtuse-angle pivot rule
- Constructing cycles in the simplex method for DPLL(T)
- A practical anti-cycling procedure for linearly constrained optimization
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
- Visualizing and Constructing Cycles in the Simplex Method
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
- On cycling in the simplex method of the transportation problem
Uses Software
This page was built for publication: Systematic construction of examples for cycling in the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489285)
