Cycling in linear programming problems
From MaRDI portal
Recommendations
- A practical anti-cycling procedure for linearly constrained optimization
- The minimum mean cycle-canceling algorithm for linear programs
- Parametric linear programming and anti-cycling pivoting rules
- Cyclic games and linear programming
- On cycling in the simplex method of the transportation problem
- Cycling can occur in Mráz's algorithm for nonconvex quadratic programming
- scientific article; zbMATH DE number 757651
- scientific article; zbMATH DE number 5809298
Cites work
- scientific article; zbMATH DE number 3115468 (Why is no real title available?)
- scientific article; zbMATH DE number 3956805 (Why is no real title available?)
- scientific article; zbMATH DE number 4066615 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 978851 (Why is no real title available?)
- A note on cycling in the simplex method
- Classroom Note:Hoffman's Circle Untangled
- Cycling in linear programming problems
- Cycling in the transportation problem
- Duality Theory of Linear Programs: A Constructive Approach with Applications
- Encounters with degeneracy: A personal view
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
Cited in
(14)- On detecting nonlinear patterns in discriminant problems
- The double pivot simplex method
- A note on cycling LP examples with permutation structure
- Systematic construction of examples for cycling in the simplex method
- scientific article; zbMATH DE number 3900488 (Why is no real title available?)
- On Hoffman's celebrated cycling LP example
- Cycling can occur in Mráz's algorithm for nonconvex quadratic programming
- scientific article; zbMATH DE number 4152143 (Why is no real title available?)
- A practical anti-cycling procedure for linearly constrained optimization
- The Deterministic Dynamic Product Cycling Problem
- 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
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Cycling in linear programming problems
This page was built for publication: Cycling in linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765542)
