Standard +0.3 This is a standard dynamic programming maximin route problem with a small network. It requires systematic tabulation following a well-defined algorithm taught in D2, with no conceptual tricks or novel insights—slightly easier than average since it's a direct application of a bookwork method with clear structure.
6 Set up a dynamic programming tabulation to find the maximin route from ( \(0 ; 0\) ) to ( \(3 ; 0\) ) on the following directed network.
\includegraphics[max width=\textwidth, alt={}, center]{76486ad4-c00e-4e0b-9527-6f13f9222dbb-7_883_1323_390_411}
6 Set up a dynamic programming tabulation to find the maximin route from ( $0 ; 0$ ) to ( $3 ; 0$ ) on the following directed network.\\
\includegraphics[max width=\textwidth, alt={}, center]{76486ad4-c00e-4e0b-9527-6f13f9222dbb-7_883_1323_390_411}
\hfill \mbox{\textit{OCR D2 2011 Q6 [9]}}