A simple direct cosine simplex algorithm
From MaRDI portal
Publication:2391301
DOI10.1016/j.amc.2009.03.080zbMath1169.65061OpenAlexW2134946150MaRDI QIDQ2391301
Publication date: 24 July 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.03.080
algorithmlinear programminginterior-point methodconstrained optimizationnumerical examplessimplex methodcosine criteriondirect cosine simplex algorithm
Related Items (7)
Three nearly scaling-invariant versions of an exterior point algorithm for linear programming ⋮ Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham ⋮ On the simplex algorithm initializing ⋮ Artificial-free simplex algorithm based on the non-acute constraint relaxation ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ On simplex method with most-obtuse-angle rule and cosine rule
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LPbook
- A new polynomial-time algorithm for linear programming
- Linear operator theory in engineering and science. Repr. of the 1971 orig., publ. by Holt, Rinehart \& Winston, Inc.
- An improved initial basis for the simplex algorithm
- New Finite Pivoting Rules for the Simplex Method
- Commentary—Interior-Point Methods: Algorithms and Formulations
- Two direct methods in linear programming
- Linear programming. Foundations and extensions
This page was built for publication: A simple direct cosine simplex algorithm