showing 4 related works from this author
Farkas-Minkowski systems in semi-infinite programming
1981
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.
Representacion finita de sistemas de infinitas inecuaciones
1982
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
1984
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.