Edexcel D2 — Question 3

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicDynamic Programming
TypeDynamic programming minimax route
DifficultyStandard +0.3 This is a standard D2 dynamic programming minimax problem requiring systematic table completion and backtracking. While it involves multiple steps, the algorithm is mechanical and follows a well-practiced procedure taught explicitly in the syllabus, making it easier than average A-level questions that require problem-solving insight.
Spec7.01d Multiplicative principle: arrangements of n distinct objects

3. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 2} \includegraphics[alt={},max width=\textwidth]{195b1c1f-5ce3-4762-80c3-34c26382b88b-004_764_1514_283_141}
\end{figure} The network in Fig. 2 shows possible routes that an aircraft can take from \(S\) to \(T\). The numbers on the directed arcs give the amount of fuel used on that part of the route, in appropriate units. The airline wishes to choose the route for which the maximum amount of fuel used on any part of the route is as small as possible. This is the rninimax route.
  1. Complete the table in the answer booklet.
    (8)
  2. Hence obtain the minimax route from \(S\) to \(T\) and state the maximum amount of fuel used on any part of this route.
    (2)

Question 3:
Part (a)
AnswerMarks Guidance
AnswerMark Guidance
AB (\(x\)), BC (27), BE (19), EF (20), AG (30), DG (25)M1 For first 4 arcs correct (with AB chosen first)
A1All 6 arcs correct in order
Part (b)
AnswerMarks Guidance
AnswerMark Guidance
Double the MST and add a return arc: \(2(x + 27 + 19 + 20 + 30 + 25) = 2(121 + x)\) giving upper bound of \(242 + 2x\)B1ft Follow through their MST doubled
Part (c)
AnswerMarks Guidance
AnswerMark Guidance
A→B (\(x\)), B→E (19), E→F (20), F→G (49), G→D (25), D→C (24), C→A (41); Total = \(x + 178\)M1 Correct application of nearest neighbour from A
A1Correct route and total
Part (d)
AnswerMarks Guidance
AnswerMark Guidance
Route from F: \(F–E–B–A–G–D–C–F = 20+19+x+30+25+24+35 = 153+x\)B1 Correct total for F route
The route starting at F gives a better upper bound as \(153+x < x+178\)B1 Correct comparison with reason
Part (e)
AnswerMarks Guidance
AnswerMark Guidance
Lower bound = MST (minus A) + two shortest arcs from AM1 Correct method shown
MST of remaining network + shortest two arcs from A: \(159 = \text{MST}_{-A} + x + 21\)M1 Setting up equation
\(x = 159 - 21 - \text{(sum of MST arcs without A)}\); solving gives \(x = 23\)A1 \(x = 23\)
Part (f)
AnswerMarks Guidance
AnswerMark Guidance
\(159 \leqslant L \leqslant 176\)B1ft Correct lower bound 159
B1ftCorrect upper bound (their better upper bound with \(x=23\))
# Question 3:

## Part (a)
| Answer | Mark | Guidance |
|--------|------|----------|
| AB ($x$), BC (27), BE (19), EF (20), AG (30), DG (25) | M1 | For first 4 arcs correct (with AB chosen first) |
| | A1 | All 6 arcs correct in order |

## Part (b)
| Answer | Mark | Guidance |
|--------|------|----------|
| Double the MST and add a return arc: $2(x + 27 + 19 + 20 + 30 + 25) = 2(121 + x)$ giving upper bound of $242 + 2x$ | B1ft | Follow through their MST doubled |

## Part (c)
| Answer | Mark | Guidance |
|--------|------|----------|
| A→B ($x$), B→E (19), E→F (20), F→G (49), G→D (25), D→C (24), C→A (41); Total = $x + 178$ | M1 | Correct application of nearest neighbour from A |
| | A1 | Correct route and total |

## Part (d)
| Answer | Mark | Guidance |
|--------|------|----------|
| Route from F: $F–E–B–A–G–D–C–F = 20+19+x+30+25+24+35 = 153+x$ | B1 | Correct total for F route |
| The route starting at F gives a better upper bound as $153+x < x+178$ | B1 | Correct comparison with reason |

## Part (e)
| Answer | Mark | Guidance |
|--------|------|----------|
| Lower bound = MST (minus A) + two shortest arcs from A | M1 | Correct method shown |
| MST of remaining network + shortest two arcs from A: $159 = \text{MST}_{-A} + x + 21$ | M1 | Setting up equation |
| $x = 159 - 21 - \text{(sum of MST arcs without A)}$; solving gives $x = 23$ | A1 | $x = 23$ |

## Part (f)
| Answer | Mark | Guidance |
|--------|------|----------|
| $159 \leqslant L \leqslant 176$ | B1ft | Correct lower bound 159 |
| | B1ft | Correct upper bound (their better upper bound with $x=23$) |

---
3.

\begin{figure}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Figure 2}
  \includegraphics[alt={},max width=\textwidth]{195b1c1f-5ce3-4762-80c3-34c26382b88b-004_764_1514_283_141}
\end{center}
\end{figure}

The network in Fig. 2 shows possible routes that an aircraft can take from $S$ to $T$. The numbers on the directed arcs give the amount of fuel used on that part of the route, in appropriate units. The airline wishes to choose the route for which the maximum amount of fuel used on any part of the route is as small as possible. This is the rninimax route.
\begin{enumerate}[label=(\alph*)]
\item Complete the table in the answer booklet.\\
(8)
\item Hence obtain the minimax route from $S$ to $T$ and state the maximum amount of fuel used on any part of this route.\\
(2)
\end{enumerate}

\hfill \mbox{\textit{Edexcel D2  Q3}}