On simplex method with most-obtuse-angle rule and cosine rule
From MaRDI portal
Publication:548344
DOI10.1016/j.amc.2011.02.063zbMath1218.65059OpenAlexW2037022520MaRDI QIDQ548344
Publication date: 28 June 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.063
Related Items (4)
Robust identification of enzymatic nonlinear dynamical systems for 1,3-propanediol transport mechanisms in microbial batch culture ⋮ Artificial-free simplex algorithm based on the non-acute constraint relaxation ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ Dual–primal algorithm for linear optimization
Uses Software
Cites Work
- The sagitta method for solving linear programs
- Practical finite pivoting rules for the simplex method
- A note on ``An improved initial basis for the simplex algorithm
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Pivot versus interior point methods: Pros and cons
- A note on two direct methods in linear programming
- An improved initial basis for the simplex algorithm
- A simple direct cosine simplex algorithm
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- Phase I cycling under the most-obtuse-angle pivot rule
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- A Variant of the Dual Pivoting Rule in Linear Programming
- Two direct methods in linear programming
- Two-variable linear programming in parallel
This page was built for publication: On simplex method with most-obtuse-angle rule and cosine rule
