A Simple Direct Cosine Simplex Algorithm

Elsevier Science Inc
Publication Type:
Journal Article
Applied Mathematics And Computation, 2009, 214 (1), pp. 178 - 186
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
2010004099OK.pdf475.11 kB
Adobe PDF
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 algorith
Please use this identifier to cite or link to this item: