0000000000285216
AUTHOR
Marco A. López
Convex semi-infinite games
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.
Farkas-Minkowski systems in semi-infinite programming
The Farkas-Minkowski systems are characterized through a convex cone associated to the system, and some sufficient conditions are given that guarantee the mentioned property. The role of such systems in semi-infinite programming is studied in the linear case by means of the duality, and, in the nonlinear case, in connection with optimality conditions. In the last case the property appears as a constraint qualification.
Optimality conditions for nondifferentiable convex semi-infinite programming
This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.
Representacion finita de sistemas de infinitas inecuaciones
Dado un problema de Programacion Semi-Infinita, si se puede obtener una representacion finita del conjunto factible, pueden aplicarse para resolver el problema los metodos de programacion con finitas restricciones.
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.