Phase I cycling under the most-obtuse-angle pivot rule

DOI10.1016/J.EJOR.2003.06.048MaRDI QIDQ2484337zbMATH OpenOpenAlexFDO

Authors Pablo Guerrero-García, Ángel Santos-Palomo

Publication date 1 August 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2003.06.048

zbMATH Keywords

Linear programmingMost-obtuse-anglePhase I cyclingRatio-test-free

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• scientific article; zbMATH DE number 3904322
• Systematic construction of examples for cycling in the simplex method
• On simplex method with most-obtuse-angle rule and cosine rule

Cites work

• scientific article; zbMATH DE number 194432 (Why is no real title available?)
• scientific article; zbMATH DE number 3069636 (Why is no real title available?)
• A Variant of the Dual Pivoting Rule in Linear Programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• A phase-1 approach for the generalized simplex algorithm
• An example of cycling in a feasible point algorithm
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study

Cited in

(3)

• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• On simplex method with most-obtuse-angle rule and cosine rule
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis

This page was built for publication: Phase I cycling under the most-obtuse-angle pivot rule

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