Monoextremal Representations of a Class of Minimax Problems

M. D. Canon
Additional contact information
M. D. Canon: IBM Research Laboratory, San Jose, California

Management Science, 1969, vol. 15, issue 5, 228-238

Abstract: It is shown that minimax problems with convex-concave payoff and convex inequality constraints can be reduced to solving an equivalent constrained minimization problem. The objective function of the minimization problem is not convex, nor is the set of feasible solutions convex. Nevertheless, it is shown that any point which satisfies the first order necessary conditions for optimality must be a global minimum.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.15.5.228 (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:ormnsc:v:15:y:1969:i:5:p:228-238

Access Statistics for this article

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