The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
From MaRDI portal
Publication:3842984
Recommendations
- On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
- A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
- Pivoting in linear complementarity: Two polynomial-time cases
- On Finding Primal- and Dual-Optimal Bases
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
Cites work
Cited in
(11)- Criss-cross methods: A fresh view on pivot algorithms
- EP theorems and linear complementarity problems
- Pivot versus interior point methods: Pros and cons
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
- Lexicographic perturbation for multiparametric linear programming with applications to control
- Multiparametric linear programming with applications to control
- On the existence of a short pivoting sequence for a linear program
- On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Finiteness of Criss-Cross Method in Complementarity Problem
This page was built for publication: The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3842984)