More on Min-Max Allocation
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.
Year of publication: |
1972
|
---|---|
Authors: | Porteus, Evan L. ; Yormark, Jonathan S. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 18.1972, 9, p. 502-507
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Optimal Real Estate Portfolios
Findlay, M. Chapman, (1979)
-
An approach to single parameter process design
Groote, Xavier de, (1992)
-
On the optimality of structured policies in countable stage decision processes
Porteus, Evan L., (1975)
- More ...