Proving Minimax using LP Duality

Formulate a player's maximin problem in a zero-sum game as a linear program.

Demonstrate that the dual of the maximin LP corresponds to the opponent's minimax problem.

Derive the minimax theorem as a direct consequence of the strong duality theorem of linear programming.

Interpret the optimal primal and dual solutions of the game's LP formulation as the value of the game and the optimal mixed strategies.