Practical finite pivoting rules for the simplex method
From MaRDI portal
Recommendations
Cites work
- A class of linear programming problems requiring a large number of iterations
- A practicable steepest-edge simplex algorithm
- A Technique for Resolving Degeneracy in Linear Programming
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- New Finite Pivoting Rules for the Simplex Method
- On the choice of the pivot columns of the simplex-method: Gradient criteria
- Optimality and Degeneracy in Linear Programming
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- Worst case behavior of the steepest edge simplex method
Cited in
(60)- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- On the choice of the pivot columns of the simplex-method: Gradient criteria
- Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
- A dual projective simplex method for linear programming
- A new pivoting rule for solving various degeneracy problems
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Selected bibliography on degeneracy
- Degeneracy graphs: Theory and applications. An updated survey
- Pivot rules for linear programming: A survey on recent theoretical developments
- The simplex algorithm with a new primal and dual pivot rule
- A phase-1 approach for the generalized simplex algorithm
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- A basis-defiency-allowing variation of the simplex method for linear programming
- A note on two direct methods in linear programming
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- A projective simplex algorithm using LU decomposition
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
- Reinforcement learning of simplex pivot rules: a proof of concept
- A largest-distance pivot rule for the simplex algorithm
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- A primal deficient-basis simplex algorithm for linear programming
- Systematic construction of examples for cycling in the simplex method
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
- The role of the pivot technique in the proof of some fundamental theorems of linear algebra.
- Finiteness of the quadratic simplex method with the application of index selection rules
- An affine-scaling pivot algorithm for linear programming
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- Cone-cutting: a variant representation of pivot in simplex
- Markov decision processes for infinite horizon problems solved with the cosine simplex method
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
- A new analysis for monotonic type simplex algorithms for feasibility problems
- Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
- What is the worst case behavior of the simplex algorithm?
- scientific article; zbMATH DE number 3904322 (Why is no real title available?)
- Simplex pivots on the set packing polytope
- scientific article; zbMATH DE number 3961338 (Why is no real title available?)
- On practical stopping rules for the simplex method
- scientific article; zbMATH DE number 4045475 (Why is no real title available?)
- A simplex-like method with bisection for linear programming1
- scientific article; zbMATH DE number 179276 (Why is no real title available?)
- scientific article; zbMATH DE number 1203292 (Why is no real title available?)
- A Monotonic Build-Up Simplex Algorithm for Linear Programming
- A Variant of the Dual Pivoting Rule in Linear Programming
- scientific article; zbMATH DE number 1960976 (Why is no real title available?)
- Artificial-free simplex algorithm based on the non-acute constraint relaxation
- scientific article; zbMATH DE number 803005 (Why is no real title available?)
- Dual-primal algorithm for linear optimization
- Computing and proving with pivots
- scientific article; zbMATH DE number 6263045 (Why is no real title available?)
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
- On simplex method with most-obtuse-angle rule and cosine rule
- The double pivot simplex method
- MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
- A note on ``An improved initial basis for the simplex algorithm
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
- Experiments with external pivoting
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- Efficient nested pricing in the simplex algorithm
- A computational approach to pivot selection in the LP relaxation of set problems
This page was built for publication: Practical finite pivoting rules for the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751498)
