On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory

On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory

0.00 Avg rating0 Votes
Article ID: iaor20082007
Country: Netherlands
Volume: 132
Issue: 3
Start Page Number: 423
End Page Number: 439
Publication Date: Mar 2007
Journal: Journal of Optimization Theory and Applications
Authors: , ,
Keywords: game theory, lagrange multipliers
Abstract:

In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property for compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory. We apply these results to derive necessary and sufficient conditions for strong duality for a general class of optimization problems.

Reviews

Required fields are marked *. Your email address will not be published.