A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
From MaRDI portal
Publication:2475881
DOI10.1016/j.camwa.2005.11.033zbMath1178.90247OpenAlexW2141002044MaRDI QIDQ2475881
Wei Li, Ángel Santos-Palomo, Pablo Guerrero-García
Publication date: 11 March 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.11.033
Related Items (7)
A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ Three nearly scaling-invariant versions of an exterior point algorithm for linear programming ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Dual–primal algorithm for linear optimization ⋮ On simplex method with most-obtuse-angle rule and cosine rule ⋮ An interesting characteristic of phase-1 of dual–primal algorithm for linear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- The sagitta method for solving linear programs
- Practical finite pivoting rules for the simplex method
- A direct method for sparse least squares problems with lower and upper bounds
- A dual projective simplex method for linear programming
- 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
- Phase I cycling under the most-obtuse-angle pivot rule
This page was built for publication: A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
