Phase I cycling under the most-obtuse-angle pivot rule
From MaRDI portal
(Redirected from Publication:2484337)
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
- A basis-defiency-allowing variation of the simplex method for linear programming
- A phase-1 approach for the generalized simplex algorithm
- A Variant of the Dual Pivoting Rule in Linear Programming
- An example of cycling in a feasible point algorithm
- scientific article; zbMATH DE number 194432 (Why is no real title available?)
- scientific article; zbMATH DE number 3069636 (Why is no real title available?)
- 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
(4)- 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
- MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
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)
