Standard +0.3 This is a straightforward application of the dynamic programming algorithm for maximin routes. Part (a) tests basic definition recall, part (b) is a standard tabular method requiring systematic but routine calculations, and part (c) requires careful checking but no novel insight. The 14-mark allocation reflects length rather than conceptual difficulty—this is typical D2 bookwork with mechanical execution.
4. (a) Explain what is meant by a maximin route in dynamic programming, and give an example of a situation that would require a maximin solution.
(3)
\includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-2_700_1392_1069_338}
A maximin route is to be found through the network shown in the diagram.
(b) Complete the table in the answer book, and hence find a maximin route.
(9)
(c) List all other maximin routes through the network.
(Total 14 marks)
4. (a) Explain what is meant by a maximin route in dynamic programming, and give an example of a situation that would require a maximin solution.\\
(3)\\
\includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-2_700_1392_1069_338}
A maximin route is to be found through the network shown in the diagram.\\
(b) Complete the table in the answer book, and hence find a maximin route.\\
(9)\\
(c) List all other maximin routes through the network.\\
(Total 14 marks)\\
\hfill \mbox{\textit{Edexcel D2 2005 Q4 [14]}}