On anti-cycling pivoting rules for the simplex method

DOI10.1016/0167-6377(91)90058-WMaRDI QIDQ1178727zbMATH OpenOpenAlexFDO

Authors Shuzhong 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

anti-cycling pivoting rulesimplex method

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3626518 (Why is no real title available?)
• New Finite Pivoting Rules for the Simplex Method

Cited in

(10)

• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
• 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
• Criss-cross methods: A fresh view on pivot algorithms
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• New variants of finite criss-cross pivot algorithms for linear programming
• Systematic construction of examples for cycling in the simplex method
• scientific article; zbMATH DE number 4152143 (Why is no real title available?)
• Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix

This page was built for publication: On anti-cycling 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 Q1178727)