Moderate -0.5 This is a standard dynamic programming/network optimization problem typical of D2 module. It requires systematic application of a forward or backward pass algorithm through the network to find the maximum profit path. While it has 12 marks indicating multiple steps, the technique is routine and well-practiced - students simply need to apply the algorithm methodically without requiring novel insight or complex problem-solving beyond the standard procedure.
Victor owns some kiosks selling ice cream, hot dogs and soft drinks.
The network below shows the choices of action and the profits, in thousands of pounds, they generate over the next four years. The negative numbers indicate losses due to the purchases of new kiosks.
\includegraphics{figure_5}
Use a suitable algorithm to determine the sequence of actions so that the profit over the four years is maximised and state this maximum profit.
(Total 12 marks)
Victor owns some kiosks selling ice cream, hot dogs and soft drinks.
The network below shows the choices of action and the profits, in thousands of pounds, they generate over the next four years. The negative numbers indicate losses due to the purchases of new kiosks.
\includegraphics{figure_5}
Use a suitable algorithm to determine the sequence of actions so that the profit over the four years is maximised and state this maximum profit.
(Total 12 marks)
\hfill \mbox{\textit{Edexcel D2 2006 Q5}}