Classical simplex methods for linear programming and their developments

MaRDI QIDQ5309636zbMATH OpenFDO

Authors Zi-Zong Yan, Pusheng Fei, Zhongping Wan

Publication date 9 October 2007

zbMATH Keywords

duality gappivot rulesimplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Recommendations

• A new efficient primal dual simplex algorithm
• A primal-dual simplex method for linear programs
• The simplex algorithm with a new primal and dual pivot rule
• Linear programming computation
• Computational aspects of linear programming simplex method

Cited in

(7)

• The simplex algorithm with a new primal and dual pivot rule
• A new efficient primal dual simplex algorithm
• A modified non-simplex active-set method for the standard LP problem
• Simplex algorithms for linear programming
• A simplex-like method with bisection for linear programming¹
• On the development of simplex methods for linear multiplier-alike method
• On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method

This page was built for publication: Classical simplex methods for linear programming and their developments

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