A Simple Direct Cosine Simplex Algorithm

Yeh, W; Corley, HW

A Simple Direct Cosine Simplex Algorithm

Yeh, W Corley, HW

Permalink

Publisher:: Elsevier Science Inc
Publication Type:: Journal Article
Citation:: Applied Mathematics And Computation, 2009, 214 (1), pp. 178 - 186
Issue Date:: 2009-01

Closed Access

	Filename	Description	Size
	2010004099OK.pdf		475.11 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yeh, W	en_US
dc.contributor.author	Corley, HW	en_US
dc.date.issued	2009-01	en_US
dc.identifier.citation	Applied Mathematics And Computation, 2009, 214 (1), pp. 178 - 186	en_US
dc.identifier.issn	0096-3003	en_US
dc.identifier.uri	http://hdl.handle.net/10453/14491
dc.description.abstract	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	en_US
dc.publisher	Elsevier Science Inc	en_US
dc.relation.ispartof	Applied Mathematics And Computation	en_US
dc.relation.isbasedon	10.1016/j.amc.2009.03.080	en_US
dc.subject.classification	Numerical & Computational Mathematics	en_US
dc.title	A Simple Direct Cosine Simplex Algorithm	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	214	en_US
utslib.location.activity	ISI:000267585200022	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
dc.location.activity	ISI:000267585200022	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - AAI - Advanced Analytics Institute Research Centre
utslib.copyright.status	closed_access
pubs.consider-herdc	false	en_US
pubs.issue	1	en_US
pubs.volume	214	en_US

Abstract:

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:

http://hdl.handle.net/10453/14491