A simple direct cosine simplex algorithm

DOI10.1016/J.AMC.2009.03.080MaRDI QIDQ2391301zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

linear programmingnumerical examplesalgorithmconstrained optimizationsimplex methodinterior-point methodcosine criteriondirect cosine simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Recommendations

• scientific article; zbMATH DE number 4158377
• Computational aspects of linear programming simplex method
• A fast simplex algorithm for linear programming
• On simplex method with most-obtuse-angle rule and cosine rule
• An improved algorithm of simplex method in linear programming problem

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• An improved initial basis for the simplex algorithm
• Commentary—Interior-Point Methods: Algorithms and Formulations
• LPbook
• Linear operator theory in engineering and science. Repr. of the 1971 orig., publ. by Holt, Rinehart \& Winston, Inc.
• Linear programming. Foundations and extensions
• New Finite Pivoting Rules for the Simplex Method
• Two direct methods in linear programming

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

Describes a project that uses

Uses Software

• LPbook
• NETLIB LP Test Set
• MarPlex

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)