Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation

Seymour Kaplan
Additional contact information
Seymour Kaplan: New York University, New York, New York

Operations Research, 1974, vol. 22, issue 4, 802-807

Abstract: A mathematical program with a maximin objective function is defined as an optimization problem of the following type: Maxz = min i c i x i , subject to AX = b, X ≧ 0. Although the c i can be in the interval (− ∞, ∞), the paper discusses the more common practical case where all c i ≧ 0. It shows that problems of this type arise in a variety of applications where it is required to maximize a production function of the “fixed proportion” type subject to a set of linear constraints. Although it is well known that the solution to this type of problem can be found by linear programming, this paper shows that, if the existence of a certain condition can be demonstrated, then a simplified method can be used to determine the optimum solution. Many problems of practical interest can be solved by this simplified method; an example involving the readiness of a ship is presented.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.4.802 (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:22:y:1974:i:4:p:802-807

Access Statistics for this article

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