Edexcel D2 2010 June — Question 4

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Year2010
SessionJune
TopicDynamic Programming

4. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{a91f96a3-a9b4-4bf5-bfdf-93c34912e54a-5_774_1623_264_221} \captionsetup{labelformat=empty} \caption{Figure 1}
\end{figure} Figure 1 represents the maintenance choices a council can make and their costs, in \(\pounds 1000\) s, over the next four years. The council wishes to minimise the greatest annual cost of maintenance.
  1. Use dynamic programming to find a minimax route from S to T .
    (9)
  2. State your route and the greatest annual cost incurred by the council.
    (2)
  3. Calculate the average annual cost to the council.
    (2)