Computer Science Technical Reports
CS at VT

Attainable Resource Allocation Bounds

Haddad, Emile K. (1990) Attainable Resource Allocation Bounds. Technical Report TR-90-02, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-90-02.pdf (730614)


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 the attainable bounds to the specified bounds are presented, which are computationally superior to the traditional "modified simplex method". An efficient algorithm is presented, and its computational complexity is analyzed.

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