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

DOI10.1016/J.EJOR.2003.06.048zbMATH Open1074.90026OpenAlexW2036573988MaRDI QIDQ2484337FDOQ2484337

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

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

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)