×

Minimax problems in mathematical programming and discrete optimal control. (English) Zbl 0555.49018

The aim of the paper is to use the recent concept of the so-called indicating cone for a set in order to formulate explicitly necessary optimality conditions for minimax problems. Static and discrete dynamical problems are treated using a general form of an ”intersection principle”. Also mathematical programming problems having a continuum of inequality type constraints are briefly discussed and necessary optimality conditions derived.

MSC:

49K35 Optimality conditions for minimax problems
52A20 Convex sets in \(n\) dimensions (including convex hypersurfaces)
90C30 Nonlinear programming
PDFBibTeX XMLCite
Full Text: EuDML