Attainable Resource Allocations Bounds

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