.png){kind=icon}
Return
More on Min-Max Allocation
.png){kind=icon}
PRE
AI
DOI：10.1287/mnsc.18.9.502.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a preceding paper Jacobsen [Jacobsen, S. 1971. On marginal allocation in single constraint min-max problems. Management Sci. (July).] shows that marginal allocation solves a class of discrete, single constraint, min-max allocation problems. A dual approach, to this problem is presented, based on a generalization of Jacobsen's P condition, which should prove more efficient when many marginal improvement iterations would be required. A variant of sequential search by bisection is applied, possibly augmented by an accelerated marginal allocation scheme, in which finite convergence to an optimum solution is guaranteed.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available