Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
From MaRDI portal
Recommendations
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Practical finite pivoting rules for the simplex method
- Parametric linear programming and anti-cycling pivoting rules
- Systematic construction of examples for cycling in the simplex method
Cites work
- A Monotonic Build-Up Simplex Algorithm for Linear Programming
- Assembly-Line Balancing by Linear Programming
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- The role of pivoting in proving some fundamental theorems of linear algebra
Cited in
(5)- Exterior point simplex-type algorithms for linear and network optimization problems
- A corrector-predictor interior-point method with new search direction for linear optimization
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
This page was built for publication: Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5413871)
