Attainable Resource Allocations Bounds
1989) Attainable Resource Allocations Bounds. Technical Report TR-89-24, 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 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)|
|Deposited By:||User autouser|
|Deposited On:||05 December 2001|