Pivot rules for linear programming: A survey on recent theoretical developments
From MaRDI portal
Publication:1312760
DOI10.1007/BF02096264zbMath0793.90034WikidataQ54105206 ScholiaQ54105206MaRDI QIDQ1312760
Tamás Terlaky, Shu-Zhong Zhang
Publication date: 7 February 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
LPAKO: A Simplex-based Linear Programming Program, Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems, Combined projected gradient algorithm for linear programming, On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method, The sagitta method for solving linear programs, A simpler and tighter redundant Klee-Minty construction, Efficient nested pricing in the simplex algorithm, A redundant Klee-Minty construction with all the redundant constraints touching the feasible region, Degeneracy in interior point methods for linear programming: A survey, The use of the optimal partition in a linear programming solution for postoptimal analysis, Criss-cross methods: A fresh view on pivot algorithms, Pivot versus interior point methods: Pros and cons, New variants of finite criss-cross pivot algorithms for linear programming, A new efficient primal dual simplex algorithm, Numerical aspects in developing LP softwares, LPAKO and LPABO, A projective simplex algorithm using LU decomposition, A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, A computationally stable solution algorithm for linear programs, How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds, The central path visits all the vertices of the Klee–Minty cube
Uses Software
Cites Work
- The steepest descent gravitational method for linear programming
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Practical finite pivoting rules for the simplex method
- The principal pivoting method revisited
- Linear quadratic programming in oriented matroids
- A new polynomial-time algorithm for linear programming
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- An infeasible (exterior point) simplex algorithm for assignment problems
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- A finite crisscross method for oriented matroids
- The simplex method. A probabilistic analysis
- A finite conformal-elimination free algorithm over oriented matroid programming
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- A new algorithm for quadratic programming
- A dual approach to primal degeneracy
- On the solution of highly degenerate linear programmes
- Parametric linear programming and anti-cycling pivoting rules
- Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
- On the finiteness of the criss-cross method
- On anti-cycling pivoting rules for the simplex method
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Oriented matroids
- A combinatorial abstraction of linear programming
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- A practical anti-cycling procedure for linearly constrained optimization
- An exterior point simplex algorithm for (general) linear programming problems
- Steepest-edge simplex algorithms for linear programming
- The gravitational method for linear programming
- The duoplex-algorithm
- The Criss-Cross Method for Solving Linear Programming Problems
- Complementarity in Oriented Matroids
- A convergent criss-cross method
- The d-Step Conjecture and Its Relatives
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD
- Computational complexity of parametric linear programming
- Least-index resolution of degeneracy in quadratic programming
- The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- On Finding Primal- and Dual-Optimal Bases
- Implementing the Simplex Method: The Initial Basis
- A Note on Convergence of the Ford-Fulkerson Flow Algorithm
- New Finite Pivoting Rules for the Simplex Method
- Implementing the simplex method for the Optimization Subroutine Library
- Some generalizations of the criss-cross method for quadratic programming
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- Variants of the Hungarian method for solving linear programming problems
- The pivot and probe algorithm for solving a linear program
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- Bimatrix Equilibrium Points and Mathematical Programming
- Pivot selection methods of the Devex LP code
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
