The simplex algorithm with a new primal and dual pivot rule

DOI10.1016/0167-6377(94)90023-XzbMath0812.90115OpenAlexW2086346232MaRDI QIDQ1342283

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

degeneracypivoting rulesLemke's methodsimplex-type algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (8)

Criss-cross methods: A fresh view on pivot algorithms ⋮ Resolution of the problem of degeneracy in a primal and dual simplex algorithm ⋮ A projective simplex algorithm using LU decomposition ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods ⋮ The complex interior-boundary method for linear and nonlinear programming with linear constraints ⋮ An efficient simplex type algorithm for sparse and dense linear programs. ⋮ A new efficient primal dual simplex algorithm

Uses Software

• Matlab

Cites Work

• A practical anti-cycling procedure for linearly constrained optimization
• Bimatrix Equilibrium Points and Mathematical Programming
• Unnamed Item

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