Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1169.65061
Yeh, Wei-Chang; Corley, H.W.
A simple direct cosine simplex algorithm. (English)
[J] Appl. Math. Comput. 214, No. 1, 178-186 (2009). ISSN 0096-3003

Summary: Linear programming (LP) is the core model of constrained optimization. The simplex method (simplex in short) has been proven in practice to perform very well in small- or medium-sized LP problems. A new algorithm called the direct cosine simplex algorithm (DCA) is presented here to improve upon simplex and to solve LP problems. The proposed DCA implements a specific cosine criterion to choose the entering variable instead of the traditional most negative rule used in simplex. Three examples are given to illustrate the implementation of the proposed DCA to improve simplex and to serve as the optimization tool. The utility of the proposed approach is evident from the extensive computational results on test problems adapted from NETLIB. DCA reduced the number of iterations of simplex in most cases in our computational experiment. Preliminary results for medium-sized problems are encouraging.

MSC 2000:: *65K05 Mathematical programming (numerical methods)

Keywords: constrained optimization; linear programming; simplex method; cosine criterion; interior-point method; numerical examples; algorithm; direct cosine simplex algorithm

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]