Pivot rules for linear programming: A survey on recent theoretical developments
From MaRDI portal
Recommendations
- Practical finite pivoting rules for the simplex method
- New variants of finite criss-cross pivot algorithms for linear programming
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- A Monotonic Build-Up Simplex Algorithm for Linear Programming
- scientific article; zbMATH DE number 3904322
Cites work
- scientific article; zbMATH DE number 3904322 (Why is no real title available?)
- scientific article; zbMATH DE number 3961338 (Why is no real title available?)
- scientific article; zbMATH DE number 4005973 (Why is no real title available?)
- scientific article; zbMATH DE number 4106867 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3672004 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3523317 (Why is no real title available?)
- scientific article; zbMATH DE number 3626518 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- A Note on Convergence of the Ford-Fulkerson Flow Algorithm
- A combinatorial abstraction of linear programming
- A convergent criss-cross method
- A dual approach to primal degeneracy
- A finite conformal-elimination free algorithm over oriented matroid programming
- A finite crisscross method for oriented matroids
- A new algorithm for quadratic programming
- A new polynomial-time algorithm for linear programming
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- An exterior point simplex algorithm for (general) linear programming problems
- An infeasible (exterior point) simplex algorithm for assignment problems
- Bimatrix Equilibrium Points and Mathematical Programming
- Complementarity in Oriented Matroids
- Computational complexity of parametric linear programming
- Implementing the Simplex Method: The Initial Basis
- Implementing the simplex method for the Optimization Subroutine Library
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Least-index resolution of degeneracy in quadratic programming
- Linear quadratic programming in oriented matroids
- New Finite Pivoting Rules for the Simplex Method
- New purification algorithms for linear programming
- On Finding Primal- and Dual-Optimal Bases
- On anti-cycling pivoting rules for the simplex method
- On the finiteness of the criss-cross method
- On the solution of highly degenerate linear programmes
- Oriented matroids
- Parametric linear programming and anti-cycling pivoting rules
- Pivot selection methods of the Devex LP code
- Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- Practical finite pivoting rules for the simplex method
- Some generalizations of the criss-cross method for quadratic programming
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Steepest-edge simplex algorithms for linear programming
- The d-Step Conjecture and Its Relatives
- The Criss-Cross Method for Solving Linear Programming Problems
- The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
- The duoplex-algorithm
- The gravitational method for linear programming
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- The pivot and probe algorithm for solving a linear program
- The principal pivoting method revisited
- The simplex method. A probabilistic analysis
- The steepest descent gravitational method for linear programming
- Variants of the Hungarian method for solving linear programming problems
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
Cited in
(67)- scientific article; zbMATH DE number 6263045 (Why is no real title available?)
- The double pivot simplex method
- A regularized simplex method
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers
- Combined projected gradient algorithm for linear programming
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- A projective simplex algorithm using LU decomposition
- Criss-cross methods: A fresh view on pivot algorithms
- The sagitta method for solving linear programs
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- Dual-primal algorithm for linear optimization
- Pivot and shift -- a mixed integer programming heuristic
- Linear programming with infinite, finite, and infinitesimal values in the right-hand side
- Efficient nested pricing in the simplex algorithm
- Degeneracy in interior point methods for linear programming: A survey
- scientific article; zbMATH DE number 3900488 (Why is no real title available?)
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm
- An interesting characteristic of phase-1 of dual-primal algorithm for linear programming
- scientific article; zbMATH DE number 179276 (Why is no real title available?)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
- On the number of degenerate simplex pivots
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
- Computing monotone disjoint paths on polytopes
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- LPAKO: A Simplex-based Linear Programming Program
- A counterexample to the Hirsch conjecture
- On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method
- Exterior point simplex-type algorithms for linear and network optimization problems
- On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
- On the length of monotone paths in polyhedra
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Pivot rules for circuit-augmentation algorithms in linear optimization
- A new version of the improved primal simplex for degenerate linear programs
- The Polyhedral Geometry of Pivot Rules and Monotone Paths
- Limit laws for empirical optimal solutions in random linear programs
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Practical finite pivoting rules for the simplex method
- An experimental investigation of a primal-dual exterior point simplexalgorithm
- Computing and proving with pivots
- scientific article; zbMATH DE number 803005 (Why is no real title available?)
- Exponential lower bounds for many pivot rules for the simplex method
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
- An efficient algorithm for vertex enumeration of arrangement
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
- A new efficient primal dual simplex algorithm
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- Revisiting degeneracy, strict feasibility, stability, in linear programming
- A simpler and tighter redundant Klee-Minty construction
- A note on two direct methods in linear programming
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- The central path visits all the vertices of the Klee–Minty cube
- scientific article; zbMATH DE number 3904322 (Why is no real title available?)
- scientific article; zbMATH DE number 1960976 (Why is no real title available?)
- Customizing the solution process of COIN-OR's linear solvers with python
- Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
- Pivot versus interior point methods: Pros and cons
- New variants of finite criss-cross pivot algorithms for linear programming
- A computationally stable solution algorithm for linear programs
This page was built for publication: Pivot rules for linear programming: A survey on recent theoretical developments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312760)
