| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2004 |
| Session | June |
| Marks | 18 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Dynamic Programming |
| Type | Dynamic programming order sequencing |
| Difficulty | Standard +0.3 This is a standard dynamic programming problem with a clear three-stage structure (weeks 1, 2, 3) and straightforward state transitions. While it requires systematic calculation across multiple paths and careful bookkeeping of profits minus costs, the problem setup is explicit, the method is prescribed, and the execution follows a routine template taught in D2. The computational work is tedious but not conceptually demanding, making it slightly easier than average for A-level. |
| Spec | 7.05a Critical path analysis: activity on arc networks |
| Week | 1 | 2 | 3 |
| Shows | A, B, C | D, E | F, G, H |
| Show | \(A\) | \(B\) | \(C\) | \(D\) | \(E\) | \(F\) | \(G\) | \(H\) |
| Expected Profit (£) | 900 | 800 | 1000 | 1500 | 1300 | 500 | 700 | 600 |
| Travel costs (£) | \(A\) | \(B\) | \(C\) | \(D\) | \(E\) | \(F\) | \(G\) | \(H\) |
| Home | 70 | 80 | 150 | 80 | 90 | 70 | ||
| \(A\) | 180 | 150 | ||||||
| \(B\) | 140 | 120 | ||||||
| \(C\) | 200 | 210 | ||||||
| \(D\) | 200 | 160 | 120 | |||||
| \(E\) | 170 | 100 | 110 |
| Answer | Marks | Guidance |
|---|---|---|
| Answer: Stage – Number of weeks to finish. State – Show being attended. Action – Next journey to undertake | B1, B1, B1 | 3 marks |
| Answer | Marks | Guidance |
|---|---|---|
| Stage | State | Action |
| 1 | F | F – Home |
| G | G – Home | 700 – 90 = 610 * |
| H | H – Home | 600 – 70 = 530 * |
| 2 | D | DF, DG, DH |
| E | EF, EG, EH | 1300 – 170 + 420 = 1550, 1300 – 100 + 610 = 1810 *, 1300 – 110 + 530 = 1720 |
| 3 | A | AD, AE |
| B | BD, BE | 800 – 140 + 1950 = 2610 *, 800 – 120 + 1810 = 2490 |
| C | CD, CE | 1000 – 200 + 1950 = 2750 *, 1000 – 210 + 1810 = 2600 |
| 4 | Home | Home – A, Home – B, Home – C |
| M1 A1, M1 A1ft, A1 ft, M1 A1 ft, A1 ft, A1, M1 A1 | 12 marks |
| Answer | Marks | Guidance |
|---|---|---|
| Answer: Home → A → D – G. Total profit £2 600 | B2 ft 1 ft 0, B1 ft | 3 marks |
### (a)
**Answer:** Stage – Number of weeks to finish. State – Show being attended. Action – Next journey to undertake | B1, B1, B1 | 3 marks
### (b)
**Answer:**
| Stage | State | Action | Value |
|-------|-------|--------|-------|
| 1 | F | F – Home | 500 – 80 = 420 * |
| | G | G – Home | 700 – 90 = 610 * |
| | H | H – Home | 600 – 70 = 530 * |
| 2 | D | DF, DG, DH | 1500 – 200 + 420 = 1720, 1500 – 160 + 610 = 1950 *, 1500 – 120 + 530 = 1910 |
| | E | EF, EG, EH | 1300 – 170 + 420 = 1550, 1300 – 100 + 610 = 1810 *, 1300 – 110 + 530 = 1720 |
| 3 | A | AD, AE | 900 – 180 + 1950 = 2670 *, 900 – 150 + 1810 = 2560 |
| | B | BD, BE | 800 – 140 + 1950 = 2610 *, 800 – 120 + 1810 = 2490 |
| | C | CD, CE | 1000 – 200 + 1950 = 2750 *, 1000 – 210 + 1810 = 2600 |
| 4 | Home | Home – A, Home – B, Home – C | −70 + 2670 = 2600 *, −80 + 2610 = 2530, −150 + 2750 = 2600 * |
| M1 A1, M1 A1ft, A1 ft, M1 A1 ft, A1 ft, A1, M1 A1 | 12 marks
### (c)
**Answer:** Home → A → D – G. Total profit £2 600 | B2 ft 1 ft 0, B1 ft | 3 marks
---
Joan sells ice cream. She needs to decide which three shows to visit over a three-week period in the summer. She starts the three-week period at home and finishes at home. She will spend one week at each of the three shows she chooses travelling directly from one show to the next.
Table 1 gives the week in which each show is held. Table 2 gives the expected profits from visiting each show. Table 3 gives the cost of travel between shows.
\textbf{Table 1}
\begin{center}
\begin{tabular}{|c|c|c|c|}
\hline
Week & 1 & 2 & 3 \\
\hline
Shows & A, B, C & D, E & F, G, H \\
\hline
\end{tabular}
\end{center}
\textbf{Table 2}
\begin{center}
\begin{tabular}{|c|c|c|c|c|c|c|c|c|}
\hline
Show & $A$ & $B$ & $C$ & $D$ & $E$ & $F$ & $G$ & $H$ \\
\hline
Expected Profit (£) & 900 & 800 & 1000 & 1500 & 1300 & 500 & 700 & 600 \\
\hline
\end{tabular}
\end{center}
\textbf{Table 3}
\begin{center}
\begin{tabular}{|c|c|c|c|c|c|c|c|c|}
\hline
Travel costs (£) & $A$ & $B$ & $C$ & $D$ & $E$ & $F$ & $G$ & $H$ \\
\hline
Home & 70 & 80 & 150 & & & 80 & 90 & 70 \\
\hline
$A$ & & & & 180 & 150 & & & \\
\hline
$B$ & & & & 140 & 120 & & & \\
\hline
$C$ & & & & 200 & 210 & & & \\
\hline
$D$ & & & & & & 200 & 160 & 120 \\
\hline
$E$ & & & & & & 170 & 100 & 110 \\
\hline
\end{tabular}
\end{center}
It is decided to use dynamic programming to find a schedule that maximises the total expected profit, taking into account the travel costs.
\begin{enumerate}[label=(\alph*)]
\item Define suitable stage, state and action variables. [3]
\item Determine the schedule that maximises the total profit. Show your working in a table. [12]
\item Advise Joan on the shows that she should visit and state her total expected profit. [3]
\end{enumerate}
(Total 18 marks)
\hfill \mbox{\textit{Edexcel D2 2004 Q6 [18]}}