On linear programming duality and necessary and sufficient conditions in minimax theory
AbstractIn this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property of compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory.In the last section we apply these results to derive necessary and sufficient conditions for strong Lagrangean duality for a large class of optimization problems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 2004-14.
Date of creation: 14 Apr 2004
Date of revision:
Contact details of provider:
Web page: http://www.few.eur.nl/few
game theory; minimax theory; Lagrangian and linear programming duality; finite dimensional separation;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If references are entirely missing, you can add them using this form.