The simplex algorithm with a new primal and dual pivot rule

DOI10.1016/0167-6377(94)90023-XMaRDI QIDQ1342283zbMATH OpenOpenAlexFDO

Authors Hsin-Der Chen, Michael A. Saunders, Panos M. Pardalos

Publication date 1994

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(94)90023-x

zbMATH Keywords

degeneracyLemke's methodpivoting rulessimplex-type algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• Classical simplex methods for linear programming and their developments
• A Monotonic Build-Up Simplex Algorithm for Linear Programming
• Practical finite pivoting rules for the simplex method
• A fast simplex algorithm for linear programming

Cites work

• A practical anti-cycling procedure for linearly constrained optimization
• Bimatrix Equilibrium Points and Mathematical Programming
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)

Cited in

(30)

• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
• Criss-cross methods: A fresh view on pivot algorithms
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• An efficient simplex type algorithm for sparse and dense linear programs.
• A minimum-ratio-test-free approach to linear programming
• A new efficient primal dual simplex algorithm
• A projective simplex algorithm using LU decomposition
• A largest-distance pivot rule for the simplex algorithm
• An affine-scaling pivot algorithm for linear programming
• An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
• A fast simplex algorithm for linear programming
• A new analysis for monotonic type simplex algorithms for feasibility problems
• A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm†
• scientific article; zbMATH DE number 3961338 (Why is no real title available?)
• scientific article; zbMATH DE number 4045475 (Why is no real title available?)
• A Monotonic Build-Up Simplex Algorithm for Linear Programming
• Two partial pricing strategies for the simplex algorithm
• A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
• Dual-primal algorithm for linear optimization
• Exterior point simplex-type algorithms for linear and network optimization problems
• The pivot and probe algorithm for solving a linear program
• scientific article; zbMATH DE number 3894831 (Why is no real title available?)
• Classical simplex methods for linear programming and their developments
• Fresh views on some recent developments in the simplex algorithm
• Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
• The double pivot simplex method
• A primal-dual simplex method for linear programs
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
• Canonical bases in linear programming
• The complex interior-boundary method for linear and nonlinear programming with linear constraints

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: The simplex algorithm with a new primal and dual pivot rule

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342283)