More on Min-Max Allocation

Evan L. Porteus and Jonathan S. Yormark
Additional contact information
Evan L. Porteus: Graduate School of Business, Stanford University
Jonathan S. Yormark: Jet Propulsion Laboratory, California Institute of Technology

Management Science, 1972, vol. 18, issue 9, 502-507

Abstract: 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.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.9.502 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:18:y:1972:i:9:p:502-507

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().