Convex semi-infinite games

DOI10.1007/BF00939275zbMath0577.90089OpenAlexW2069135984MaRDI QIDQ1065725

Enriqueta Vercher, Marco A. López

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939275

zbMATH Keywords

minimax theoremsemi-infinite gamesexistence of optimal pure strategiesFarkas-Minkowski systemsfiniteness of the valueinequality theory

Mathematics Subject Classification ID

2-person games (91A05) Games with infinitely many players (91A07)

Related Items (3)

Marco A. López, a pioneer of continuous optimization in Spain ⋮ Non-convex infinite games ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The limiting Lagrangian as a consequence of Helly's theorem
• Constructing a perfect duality in infinite programming
• On systems of convex inequalities
• On infinite systems of linear inequalities
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• A duality theorem for semi-infinite convex programs and their finite subprograms
• Optimality conditions for nondifferentiable convex semi-infinite programming
• Direct theorems in semi-infinite convex programming
• A Semi-Infinite Game
• An Infinite Linear Program with a Duality Gap
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Duality and asymptotic solvability over cones
• Convex Analysis
• On Refinements of Some Duality Theorems in Linear Programming over Cones

This page was built for publication: Convex semi-infinite games