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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call