AQA Further Paper 3 Discrete 2024 June — Question 9 6 marks

Exam BoardAQA
ModuleFurther Paper 3 Discrete (Further Paper 3 Discrete)
Year2024
SessionJune
Marks6
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicThe Simplex Algorithm
TypeGame theory to LP
DifficultyChallenging +1.2 This is a standard Further Maths game theory question requiring dominance identification, Simplex tableau setup, and one iteration. Part (a) is straightforward dominance checking, parts (b)(i-ii) are mechanical Simplex procedures taught directly in the syllabus, and part (c) requires reading from a final tableau. While it involves multiple techniques, each step follows standard algorithms without requiring novel insight or complex problem-solving.
Spec7.07f Algebraic interpretation: explain simplex calculations7.08b Dominance: reduce pay-off matrix7.08e Mixed strategies: optimal strategy using equations or graphical method

Janet and Samantha play a zero-sum game. The game is represented by the following pay-off matrix for Janet. Samantha
Strategy\(S_1\)\(S_2\)\(S_3\)
\multirow{4}{*}{Janet}\(J_1\)276
\(J_2\)551
\(J_3\)438
\(J_4\)164
  1. Explain why Janet should never play strategy \(J_4\) [1 mark]
  2. Janet wants to maximise her winnings from the game. She defines the following variables. \(p_1 = \) the probability of Janet playing strategy \(J_1\) \(p_2 = \) the probability of Janet playing strategy \(J_2\) \(p_3 = \) the probability of Janet playing strategy \(J_3\) \(v = \) the value of the game for Janet Janet then formulates her situation as the following linear programming problem. Maximise \(P = v\) subject to \(2p_1 + 5p_2 + 4p_3 \geq v\) \(7p_1 + 5p_2 + 3p_3 \geq v\) \(6p_1 + p_2 + 8p_3 \geq v\) and \(p_1 + p_2 + p_3 \leq 1\) \(p_1, p_2, p_3 \geq 0\)
    1. Complete the initial Simplex tableau for Janet's situation in the grid below. [2 marks]
      \(P\)\(v\)\(p_1\)\(p_2\)\(p_3\)value
    2. Hence, perform one iteration of the Simplex algorithm, showing your answer on the grid below. [2 marks]
      \(P\)\(v\)\(p_1\)\(p_2\)\(p_3\)value
  3. Further iterations of the Simplex algorithm are performed until an optimal solution is reached. The grid below shows part of the final Simplex tableau.
    \(p_1\)\(p_2\)value
    10\(\frac{1}{12}\)
    01\(\frac{1}{2}\)
    Find the probability of Janet playing strategy \(J_3\) when she is playing to maximise her winnings from the game. [1 mark]

Question 9:

AnswerMarks Guidance
9(a)Explains that J 4 is dominated
by J 1 OE2.4 B1
J 1 dominates strategy J 4
AnswerMarks Guidance
Subtotal1
QMarking instructions AO

AnswerMarks
9(b)(i)Introduces four slack variables
in the column headings and
AnswerMarks Guidance
finds at least two correct rows3.1a M1
Finds all rows correctly1.1b A1
P v P P P r s t u value
1 2 3
1 –1 0 0 0 0 0 0 0 0
0 1 –2 –5 –4 1 0 0 0 0
0 1 –7 –5 –3 0 1 0 0 0
0 1 –6 –1 –8 0 0 1 0 0
0 0 1 1 1 0 0 0 1 1
AnswerMarks Guidance
Subtotal2
Pv P
1P
2P
3r s

AnswerMarks
9(b)(ii)Uses the simplex algorithm to
modify at least one non-pivot
AnswerMarks Guidance
row correctly3.1a M1
Uses the simplex algorithm to
AnswerMarks Guidance
find all rows correctly1.1b A1
P v P P P r s t u value
1 2 3
1 0 –2 –5 –4 1 0 0 0 0
0 1 –2 –5 –4 1 0 0 0 0
0 0 –5 0 1 –1 1 0 0 0
0 0 –4 4 –4 –1 0 1 0 0
0 0 1 1 1 0 0 0 1 1
AnswerMarks Guidance
Subtotal2
Pv P
1P
2P
3r s

AnswerMarks
9(c)5
Obtains
AnswerMarks Guidance
122.2a B1
12
AnswerMarks Guidance
Subtotal1
Question total6
QMarking instructions AO
Question 9:
--- 9(a) ---
9(a) | Explains that J 4 is dominated
by J 1 OE | 2.4 | B1 | As 1 ≤ 2, 6 ≤ 7 and 4 ≤ 6, strategy
J 1 dominates strategy J 4
Subtotal | 1
Q | Marking instructions | AO | Marks | Typical solution
--- 9(b)(i) ---
9(b)(i) | Introduces four slack variables
in the column headings and
finds at least two correct rows | 3.1a | M1 | See below
Finds all rows correctly | 1.1b | A1
P v P P P r s t u value
1 2 3
1 –1 0 0 0 0 0 0 0 0
0 1 –2 –5 –4 1 0 0 0 0
0 1 –7 –5 –3 0 1 0 0 0
0 1 –6 –1 –8 0 0 1 0 0
0 0 1 1 1 0 0 0 1 1
Subtotal | 2
P | v | P
1 | P
2 | P
3 | r | s | t | u | value
--- 9(b)(ii) ---
9(b)(ii) | Uses the simplex algorithm to
modify at least one non-pivot
row correctly | 3.1a | M1 | See below
Uses the simplex algorithm to
find all rows correctly | 1.1b | A1
P v P P P r s t u value
1 2 3
1 0 –2 –5 –4 1 0 0 0 0
0 1 –2 –5 –4 1 0 0 0 0
0 0 –5 0 1 –1 1 0 0 0
0 0 –4 4 –4 –1 0 1 0 0
0 0 1 1 1 0 0 0 1 1
Subtotal | 2
P | v | P
1 | P
2 | P
3 | r | s | t | u | value
--- 9(c) ---
9(c) | 5
Obtains
12 | 2.2a | B1 | 5
12
Subtotal | 1
Question total | 6
Q | Marking instructions | AO | Marks | Typical solution
Janet and Samantha play a zero-sum game.

The game is represented by the following pay-off matrix for Janet.

Samantha
\begin{tabular}{c|c|c|c}
 & Strategy & $S_1$ & $S_2$ & $S_3$ \\
\hline
\multirow{4}{*}{Janet} & $J_1$ & 2 & 7 & 6 \\
 & $J_2$ & 5 & 5 & 1 \\
 & $J_3$ & 4 & 3 & 8 \\
 & $J_4$ & 1 & 6 & 4 \\
\end{tabular}

\begin{enumerate}[label=(\alph*)]
\item Explain why Janet should never play strategy $J_4$
[1 mark]

\item Janet wants to maximise her winnings from the game.

She defines the following variables.

$p_1 = $ the probability of Janet playing strategy $J_1$

$p_2 = $ the probability of Janet playing strategy $J_2$

$p_3 = $ the probability of Janet playing strategy $J_3$

$v = $ the value of the game for Janet

Janet then formulates her situation as the following linear programming problem.

Maximise $P = v$

subject to $2p_1 + 5p_2 + 4p_3 \geq v$
$7p_1 + 5p_2 + 3p_3 \geq v$
$6p_1 + p_2 + 8p_3 \geq v$

and $p_1 + p_2 + p_3 \leq 1$
$p_1, p_2, p_3 \geq 0$

\begin{enumerate}[label=(\roman*)]
\item Complete the initial Simplex tableau for Janet's situation in the grid below.
[2 marks]

\begin{tabular}{|c|c|c|c|c|c|c|c|}
\hline $P$ & $v$ & $p_1$ & $p_2$ & $p_3$ & & & value \\
\hline & & & & & & & \\
\hline & & & & & & & \\
\hline & & & & & & & \\
\hline & & & & & & & \\
\end{tabular}

\item Hence, perform one iteration of the Simplex algorithm, showing your answer on the grid below.
[2 marks]

\begin{tabular}{|c|c|c|c|c|c|c|c|}
\hline $P$ & $v$ & $p_1$ & $p_2$ & $p_3$ & & & value \\
\hline & & & & & & & \\
\hline & & & & & & & \\
\hline & & & & & & & \\
\hline & & & & & & & \\
\end{tabular}
\end{enumerate}

\item Further iterations of the Simplex algorithm are performed until an optimal solution is reached.

The grid below shows part of the final Simplex tableau.

\begin{tabular}{|c|c|c|}
\hline $p_1$ & $p_2$ & value \\
\hline 1 & 0 & $\frac{1}{12}$ \\
\hline 0 & 1 & $\frac{1}{2}$ \\
\end{tabular}

Find the probability of Janet playing strategy $J_3$ when she is playing to maximise her winnings from the game.
[1 mark]
\end{enumerate}

\hfill \mbox{\textit{AQA Further Paper 3 Discrete 2024 Q9 [6]}}