New variants of finite criss-cross pivot algorithms for linear programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5011461
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Criss-cross methods: A fresh view on pivot algorithms
- scientific article; zbMATH DE number 4027164
Cites work
- A convergent criss-cross method
- A finite conformal-elimination free algorithm over oriented matroid programming
- A finite crisscross method for oriented matroids
- Criss-cross methods: A fresh view on pivot algorithms
- New Finite Pivoting Rules for the Simplex Method
- On anti-cycling pivoting rules for the simplex method
- On the finiteness of the criss-cross method
- Pivot rules for linear programming: A survey on recent theoretical developments
- Some generalizations of the criss-cross method for quadratic programming
- The Criss-Cross Method for Solving Linear Programming Problems
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- The role of pivoting in proving some fundamental theorems of linear algebra
Cited in
(20)- Pivot rules for linear programming: A survey on recent theoretical developments
- Criss-cross methods: A fresh view on pivot algorithms
- Pivot versus interior point methods: Pros and cons
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- A note on two direct methods in linear programming
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- scientific article; zbMATH DE number 5011461 (Why is no real title available?)
- scientific article; zbMATH DE number 4027164 (Why is no real title available?)
- A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
- Performance evaluation of a family of criss-cross algorithms for linear programming
- scientific article; zbMATH DE number 2099987 (Why is no real title available?)
- Exterior point simplex-type algorithms for linear and network optimization problems
- Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index selection rules
- The criss-cross method can take (n^d) pivots
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
- Practical finite pivoting rules for the simplex method
- Exact methods for large-scale multi-period financial planning problems
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
This page was built for publication: New variants of finite criss-cross pivot algorithms for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610181)
