Edexcel D2 2005 June — Question 9 14 marks

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Year2005
SessionJune
Marks14
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicNetwork Flows
TypeState maximum flow along specific routes
DifficultyModerate -0.8 This is a standard textbook application of the maximum flow algorithm with clearly defined steps: (a) requires simple inspection of path capacities (bottleneck identification), (b-c) involves routine application of the labelling procedure/Ford-Fulkerson algorithm, and (d) asks for a real-world example. All techniques are algorithmic and procedural with no novel problem-solving required. Slightly easier than average due to the structured, step-by-step nature and small network size.
Spec7.04f Network problems: choosing appropriate algorithm

9. \includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-6_540_1291_203_411} This diagram shows a capacitated directed network. The number on each arc is its capacity.
  1. State the maximum flow along
    1. SADT,
    2. SCET,
    3. \(S B F T\).
  2. Show these maximum flows on Diagram 1 below. \section*{Diagram 1}
    \includegraphics[max width=\textwidth, alt={}]{be329a47-a709-4719-abe6-41d388a6c631-6_561_1187_1283_721}
    Take your answer to part (b) as the initial flow pattern.
    1. Use the labelling procedure to find a maximum flow from \(S\) to \(T\). Your working should be shown on Diagram 2 below. List each flow-augmenting route you use, together with its flow. \section*{Diagram 2} \includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-7_718_1525_205_269}
    2. Draw your final flow pattern on Diagram 3 below. \includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-7_611_1196_1082_717}
    3. Prove that your flow is maximal.
  3. Give an example of a practical situation that could have been modelled by the original network.

9.\\
\includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-6_540_1291_203_411}

This diagram shows a capacitated directed network. The number on each arc is its capacity.
\begin{enumerate}[label=(\alph*)]
\item State the maximum flow along
\begin{enumerate}[label=(\roman*)]
\item SADT,
\item SCET,
\item $S B F T$.
\end{enumerate}\item Show these maximum flows on Diagram 1 below.

\section*{Diagram 1}
\begin{center}
\includegraphics[max width=\textwidth, alt={}]{be329a47-a709-4719-abe6-41d388a6c631-6_561_1187_1283_721}
\end{center}

Take your answer to part (b) as the initial flow pattern.
\item \begin{enumerate}[label=(\roman*)]
\item Use the labelling procedure to find a maximum flow from $S$ to $T$. Your working should be shown on Diagram 2 below. List each flow-augmenting route you use, together with its flow.

\section*{Diagram 2}
\includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-7_718_1525_205_269}
\item Draw your final flow pattern on Diagram 3 below.\\
\includegraphics[max width=\textwidth, alt={}, center]{be329a47-a709-4719-abe6-41d388a6c631-7_611_1196_1082_717}
\item Prove that your flow is maximal.
\end{enumerate}\item Give an example of a practical situation that could have been modelled by the original network.
\end{enumerate}

\hfill \mbox{\textit{Edexcel D2 2005 Q9 [14]}}