On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory
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||Game theory, Lagrangian duality, Minimax theory, linear programming duality|
|Persistent URL||dx.doi.org/10.1007/s10957-007-9164-6, hdl.handle.net/1765/19261|
Frenk, J.B.G., Kas, P., & Kassay, G.. (2007). On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory. Journal of Optimization Theory and Applications, 132(3), 423–439. doi:10.1007/s10957-007-9164-6