A nonconvex max‐min problem

James E. Falk and Karla Hoffman

Naval Research Logistics Quarterly, 1977, vol. 24, issue 3, 441-450

Abstract: An algorithm designed to solve a large class of nonconvex max‐min problems is described. Its usefulness and applicability is demonstrated by solving an extension of a recently introduced model which optimally allocates strategic weapon systems. The extended model is shown to be equivalent to a nonconvex mathematical program with an infinite number of constraints, and hence is not solvable by conventional procedures. An example is worked out in detail to illustrate the algorithm.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800240307

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:wly:navlog:v:24:y:1977:i:3:p:441-450

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().