An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems

DOI10.1007/BF02888777zbMath0734.90103OpenAlexW1856049118MaRDI QIDQ3363083

Jesus T. Pastor, Marco A. López, Enriqueta Vercher, Miguel Angel Goberna

Publication date: 1984

Published in: Trabajos de Estadistica y de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/40760

zbMATH Keywords

optimalityalternative theoremssemi-infinite gamesperfect dualityinfinite linear inequality systemsconvex infinite systemsnon- differentiable convex semi-infinite programming problems

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (1)

Nonsmooth semi-infinite programming problems with mixed constraints

Cites Work

• Unnamed Item
• Constructing a perfect duality in infinite programming
• On systems of convex inequalities
• On infinite systems of linear inequalities
• A Semi-Infinite Game

This page was built for publication: An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems