A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
From MaRDI portal
Publication:3755232
Recommendations
- A simplex variant solving an m d linear program in O(min(m 2,d 2)) expected number of pivot steps
- A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
- On the variance of the number of pivot steps required by the simplex algorithm
- scientific article; zbMATH DE number 949658
- On the complexity of a pivot step of the revised simplex algorithm
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers
Cited in
(10)- A simplex variant solving an m d linear program in O(min(m 2,d 2)) expected number of pivot steps
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Selected bibliography on degeneracy
- A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
- A computationally stable solution algorithm for linear programs
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- scientific article; zbMATH DE number 176291 (Why is no real title available?)
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- A primal-dual simplex method for linear programs
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
This page was built for publication: A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755232)
