Attainable Resource Allocation Bounds
1990) Attainable Resource Allocation Bounds. Technical Report TR-90-02, Computer Science, Virginia Polytechnic Institute and State University. (
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)|
|Deposited By:||User autouser|
|Deposited On:||05 December 2001|