A simple direct cosine simplex algorithm
From MaRDI portal
Publication:2391301
DOI10.1016/J.AMC.2009.03.080zbMATH Open1169.65061OpenAlexW2134946150MaRDI QIDQ2391301FDOQ2391301
Authors: H. W. Corley, W. Yeh 
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
Recommendations
linear programmingnumerical examplesalgorithmconstrained optimizationsimplex methodinterior-point methodcosine criteriondirect cosine simplex algorithm
Cites Work
- LPbook
- Linear programming. Foundations and extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved initial basis for the simplex algorithm
- New Finite Pivoting Rules for the Simplex Method
- Title not available (Why is that?)
- Two direct methods in linear programming
- Linear operator theory in engineering and science. Repr. of the 1971 orig., publ. by Holt, Rinehart \& Winston, Inc.
- Commentary—Interior-Point Methods: Algorithms and Formulations
Cited In (7)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
- Exterior point simplex-type algorithms for linear and network optimization problems
- Artificial-free simplex algorithm based on the non-acute constraint relaxation
- On simplex method with most-obtuse-angle rule and cosine rule
- Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
- On the simplex algorithm initializing
Uses Software
This page was built for publication: A simple direct cosine simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391301)
