Phase I cycling under the most-obtuse-angle pivot rule
From MaRDI portal
Publication:2484337
DOI10.1016/j.ejor.2003.06.048zbMath1074.90026MaRDI QIDQ2484337
Ángel Santos-Palomo, Pablo Guerrero-García
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
90C05: Linear programming
Related Items
On simplex method with most-obtuse-angle rule and cosine rule, A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
Cites Work
- Unnamed Item
- Unnamed Item
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- A phase-1 approach for the generalized simplex algorithm
- A basis-defiency-allowing variation of the simplex method for linear programming
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- An example of cycling in a feasible point algorithm
- A Variant of the Dual Pivoting Rule in Linear Programming