Constraint Optimal Selection Techniques (COSTs) For A Class Of Linear Programming Problems

dc.contributor.author	Sung, Tai-Kuan	en_US
dc.date.accessioned	2007-09-17T17:07:22Z
dc.date.available	2007-09-17T17:07:22Z
dc.date.issued	2007-09-17T17:07:22Z
dc.date.submitted	August 2006	en_US
dc.identifier.other	DISS-1493	en_US
dc.identifier.uri	http://hdl.handle.net/10106/538
dc.description.abstract	This dissertation describes two classes of Constraint Optimal Selection Techniques (COSTs). An algorithm of each type is developed for solving nonnegative linear programming problems. In addition, geometric interpretations of these new algorithms are given, computational results for some large-scale problems are provided, and directions for future research are discussed.	en_US
dc.description.sponsorship	Corley, Herbert W.	en_US
dc.language.iso	EN	en_US
dc.publisher	Industrial & Manufacturing Engineering	en_US
dc.title	Constraint Optimal Selection Techniques (COSTs) For A Class Of Linear Programming Problems	en_US
dc.type	Ph.D.	en_US
dc.contributor.committeeChair	Corley, Herbert W.	en_US
dc.degree.department	Industrial & Manufacturing Engineering	en_US
dc.degree.discipline	Industrial & Manufacturing Engineering	en_US
dc.degree.grantor	University of Texas at Arlington	en_US
dc.degree.level	doctoral	en_US
dc.degree.name	Ph.D.	en_US
dc.identifier.externalLink	https://www.uta.edu/ra/real/editprofile.php?onlyview=1&pid=263
dc.identifier.externalLinkDescription	Link to Research Profiles