Application of Max-Min Programs to Problems of Optimal Resource Allocation.
NEW YORK UNIV BRONX DEPT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH
Pagination or Media Count:
A Max-Min program will be defined as an optimization problem of the following type Max z Mini c sub ix 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
- Operations Research