Fresh views on some recent developments in the simplex algorithm

MaRDI QIDQ5320265zbMATH OpenFDO

Authors Jian-Feng Hu, Ping-Qi Pan

Publication date 22 July 2009

zbMATH Keywords

large-scale problemlinear programmingmost-obtuse-anglepivotsimplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient nested pricing in the simplex algorithm
• A fast simplex algorithm for linear programming
• The simplex algorithm with a new primal and dual pivot rule
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• On simplex method with most-obtuse-angle rule and cosine rule

Cited in

(4)

• An overview on the simplex algorithm
• scientific article; zbMATH DE number 764392 (Why is no real title available?)
• On simplex method with most-obtuse-angle rule and cosine rule
• Efficient nested pricing in the simplex algorithm

This page was built for publication: Fresh views on some recent developments in the simplex algorithm

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