Explain what is meant by a two-person zero-sum game with payoff matrix $A=\left(a_{i j}\right)$.

Show that the problems of the two players may be expressed as a dual pair of linear programming problems. State without proof a set of sufficient conditions for a pair of strategies for the two players to be optimal.