Application of Max-Min Programs to Problems of Optimal Resource Allocation.
Abstract
A Max-Min program will be defined as an optimization problem of the following type: Max z = Min(i) ((c sub i)(x sub i)). Subject to: AX = b, X > or = O. Although the (c sub i) can be in -infinity < (c sub i) < infinity, the paper discusses the more common practical case where all (c sub i) > or = O. It is shown that problems of the above type arise in a variety of applications where it is required to maximize a production function of the Leontief type subject to a set of linear constraints. The solution of the above problem via linear programming as well as by other methodology in certain limited cases is discussed, together with an example involving the readiness of a certain type of ship. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 30, 1972
- Accession Number
- AD0749698
Entities
People
- Seymour Kaplan
Organizations
- New York University