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

J. B. G. Frenk (), P. Kas and G. Kassay
Additional contact information
J. B. G. Frenk: Erasmus University
P. Kas: Eastern Mediterranean University
G. Kassay: Babes-Bolyai University

Journal of Optimization Theory and Applications, 2007, vol. 132, issue 3, No 5, 423-439

Abstract: 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.

Keywords: Minimax theory; Game theory; Lagrangian duality; Linear programming duality (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-007-9164-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:132:y:2007:i:3:d:10.1007_s10957-007-9164-6

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-007-9164-6

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().