Computer Science Technical Reports
CS at VT

Attainable Resource Allocations Bounds

Haddad, Emile K. (1989) Attainable Resource Allocations Bounds. Technical Report TR-89-24, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-89-24.pdf (458172)


Upper 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."

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:161
Deposited By:User autouser
Deposited On:05 December 2001