The Cosine Simplex Algorithm

Corley, HW; Rosenberger, J; Yeh, W; Sung, TK

The Cosine Simplex Algorithm

Corley, HW Rosenberger, J Yeh, W Sung, TK

Permalink

Publisher:: Springer London Ltd
Publication Type:: Journal Article
Citation:: International Journal Of Advanced Manufacturing Technology, 2006, 27 (9-Oct), pp. 1047 - 1050
Issue Date:: 2006-01

Closed Access

	Filename	Description	Size
	2010004117OK.pdf		183.99 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	Corley, HW	en_US
dc.contributor.author	Rosenberger, J	en_US
dc.contributor.author	Yeh, W	en_US
dc.contributor.author	Sung, TK	en_US
dc.date.issued	2006-01	en_US
dc.identifier.citation	International Journal Of Advanced Manufacturing Technology, 2006, 27 (9-Oct), pp. 1047 - 1050	en_US
dc.identifier.issn	0268-3768	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15276
dc.description.abstract	An extension of the simplex algorithm is presented. For a given linear programming problem, a sequence of relaxed linear programming problems is solved until a solution to the original problem is reached. Each successive relaxed problem is obtained from	en_US
dc.publisher	Springer London Ltd	en_US
dc.relation.ispartof	International Journal Of Advanced Manufacturing Technology	en_US
dc.relation.isbasedon	10.1007/s00170-004-2278-1	en_US
dc.subject.classification	Industrial Engineering & Automation	en_US
dc.title	The Cosine Simplex Algorithm	en_US
dc.type	Journal Article
utslib.citation.volume	9-Oct	en_US
utslib.citation.volume	27	en_US
utslib.location.activity	ISI:000235013400028	en_US
utslib.for	0910 Manufacturing Engineering	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	08 Information and Computing Sciences	en_US
utslib.for	09 Engineering	en_US
dc.location.activity	ISI:000235013400028	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	9-Oct	en_US
pubs.volume	27	en_US

Abstract:

An extension of the simplex algorithm is presented. For a given linear programming problem, a sequence of relaxed linear programming problems is solved until a solution to the original problem is reached. Each successive relaxed problem is obtained from

Please use this identifier to cite or link to this item:

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