On linear programming duality and necessary and sufficient conditions in minimax theory
2004-04-14
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ei200414.pdf, 0.2MB) |
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 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.
Keywords
Automatically Extracted Terms
- function
- function f
- relation
- result
- inf pf
- lemma
- minimax
- theorem
- supaa
- space
- condition
- minimax result
- proof
- strategy
- topology
- minimax results
- suppf
- definition
- problem
- functions f
