Skip to content

Latest commit

 

History

History
16 lines (13 loc) · 444 Bytes

2005-72.md

File metadata and controls

16 lines (13 loc) · 444 Bytes
course course_year question_number tags title year
Optimization
IB
72
IB
2005
Optimization
2.I.9D
2005

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.