A Max-Min Allocation Problem: Its Solutions and Applications

Christopher S. Tang
Additional contact information
Christopher S. Tang: University of California, Los Angeles, California

Operations Research, 1988, vol. 36, issue 2, 359-367

Abstract: This paper describes a max-min allocation problem that has M constraints and N nonnegative integer variables. By exploring the structure of the optimal solution to this max-min allocation problem, we develop a nonsimplex-based algorithm that finds an optimal solution within O ( MN 2 ) operations. In addition, we show that a space allocation problem for a flexible component insertion machine can be formulated as a special case of this max-min allocation problem with one constraint. Furthermore, we present some manufacturing and production problems that can he formulated as max-min allocation problems, and hence, can be solved efficiently.

Keywords: 581 production planning; 628 integer programming; 637 manufacturing applications (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.2.359 (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:oropre:v:36:y:1988:i:2:p:359-367

Access Statistics for this article

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