Necessary conditions for min-max problems and algorithms by a relaxation procedure
- 1 February 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 25 (1) , 62-66
- https://doi.org/10.1109/tac.1980.1102226
Abstract
For decision making under uncertainty, a rational optimality criterion is min-max. Min-max problems such that the minimizer makes an optimal decision against the worst case that might be chosen by the maximizer are studied. This paper presents necessary conditions and computational methods for a min-max solution (not a saddle point solution). Those conditions are stated in a form like Kuhn-Tucker theorem. The computational methods are based on the relaxation procedure. A min-max problem such that the minimizer and the maximizer are subject to separate constraints is primarily studied. But it is shown that the obtained results can be applied for the unseparate constraint case by use of duality theory.Keywords
This publication has 9 references indexed in Scilit:
- Necessary conditions and sufficient conditions for static minmax problemsJournal of Mathematical Analysis and Applications, 1977
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- An algorithm for minimax parameter optimizationAutomatica, 1972
- The Validity of a Family of Optimization MethodsSIAM Journal on Control, 1970
- Algorithms for some minimax problemsJournal of Computer and System Sciences, 1968
- Minimax controller designIEEE Transactions on Automatic Control, 1968
- The Theory of Max-Min and its Application to Weapons Allocation ProblemsPublished by Springer Nature ,1967
- The Lagrange Multiplier Theorem for Max-Min with Several ConstraintsSIAM Journal on Applied Mathematics, 1966
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960