Attainable Resource Allocations Bounds

Simple item page
dc.contributor.authorHaddad, Emile K.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:45Zen
dc.date.available2013-06-19T14:35:45Zen
dc.date.issued1989en
dc.description.abstractUpper and lower bounds attained by the variables of a generalized resource allocation problem are distinguished from the a priori specified bounds defining the feasible set. General theoretical criteria directly relating attainable bounds to specified bounds are presented, which are computationally superior to the traditional "modified simplex method."en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000161/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000161/01/TR-89-24.pdfen
dc.identifier.trnumberTR-89-24en
dc.identifier.urihttp://hdl.handle.net/10919/19557en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleAttainable Resource Allocations Boundsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-89-24.pdf
Size:
447.43 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports