On simplex method with most-obtuse-angle rule and cosine rule
From MaRDI portal
(Redirected from Publication:548344)
Recommendations
Cites work
- A Variant of the Dual Pivoting Rule in Linear Programming
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- A note on ``An improved initial basis for the simplex algorithm
- A note on two direct methods in linear programming
- A simple direct cosine simplex algorithm
- An improved initial basis for the simplex algorithm
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Phase I cycling under the most-obtuse-angle pivot rule
- Pivot versus interior point methods: Pros and cons
- Practical finite pivoting rules for the simplex method
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- The sagitta method for solving linear programs
- Two direct methods in linear programming
- Two-variable linear programming in parallel
Cited in
(8)- Artificial-free simplex algorithm based on the non-acute constraint relaxation
- Phase I cycling under the most-obtuse-angle pivot rule
- Fresh views on some recent developments in the simplex algorithm
- Robust identification of enzymatic nonlinear dynamical systems for 1,3-propanediol transport mechanisms in microbial batch culture
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
- A simple direct cosine simplex algorithm
- A note on two direct methods in linear programming
- Dual-primal algorithm for linear optimization
This page was built for publication: On simplex method with most-obtuse-angle rule and cosine rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548344)
