Consider the game having the following pay off table

Strategy

Player 1 = x

Player 2 = y

(x,y)

(1,1) = 5

(1,2) = 0

(1,3) = 3

(1,4) = 1

(2,1) = 2

(2,2) = 4

(2,3) = 3

(2,4) = 2

(3,1) = 3

(3,2) = 2

(3,3) = 0

(3,4) = 4

In the table form Player 1 on the left side, Player 2 on top.

Question:

Formulate the problem of finding optimal mixed strategies according to the minimax criterion as a linear programming problem