Haddad, Emile K.2013-06-192013-06-191989http://hdl.handle.net/10919/19557Upper 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."application/pdfenIn CopyrightTechnical reportTR-89-24http://eprints.cs.vt.edu/archive/00000161/01/TR-89-24.pdf