On anti-cycling pivoting rules for the simplex method

DOI10.1016/0167-6377(91)90058-WzbMath0813.90083OpenAlexW2023636967MaRDI QIDQ1178727

Shu-Zhong Zhang

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90058-w

zbMATH Keywords

simplex methodanti-cycling pivoting rule

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Criss-cross methods: A fresh view on pivot algorithms, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, Systematic construction of examples for cycling in the simplex method, Selected bibliography on degeneracy, Pivot rules for linear programming: A survey on recent theoretical developments, An exterior point simplex algorithm for (general) linear programming problems, New variants of finite criss-cross pivot algorithms for linear programming

Cites Work

• New Finite Pivoting Rules for the Simplex Method
• Unnamed Item
• Unnamed Item