6. Anna (A) and Roland (R) play a two-person zero-sum game which is represented by the following pay-off matrix for Anna.
R plays 1
R plays 2
R plays 3
A plays 1
6
- 2
- 3
A plays 2
- 3
1
2
A plays 3
5
4
- 1
Formulate the game as a linear programming problem for player \(\mathbf { R }\). Write the constraints as inequalities. Define your variables clearly.
(Total 8 marks)