Further Mathematics 7367: Linear Programming Topical Past Paper Questions

Janet (b)(c) and Samantha play a zero-sum game. The game is represented by the following pay-off matrix for Janet. Samantha Janet Explain why Janet should never play strategy $ J_{4} $ [1 mark] Janet wants to maximise her winnings from the game. She defines the following variable…

A student is solving the following linear programming problem. $$ Minimise \quad Q=-4x-3y $$ subject to $$ \begin{aligned}Q&=-4x-3y\\x+&\quad y\leq520\\2x-3y&\leq570\\x&\geq0,y\geq0\end{aligned} $$ and (a) The student wants to use the simplex algorithm to solve the linear program…

Kira and Julian play a zero-sum game that does not have a stable solution. Kira has three strategies to choose from: $\mathbf{K}_{1}$, $\mathbf{K}_{2}$ and $\mathbf{K}_{3}$ To determine her optimal mixed strategy, Kira begins by defining the following variables: $ v = \text{value…