Edexcel D2 2002 June — Question 8 14 marks

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Year2002
SessionJune
Marks14
PaperDownload PDF ↗
TopicNetwork Flows
TypeAdd supersource and/or supersink
DifficultyModerate -0.3 This is a standard textbook application of the max-flow min-cut algorithm with multiple sources requiring a supersource. Parts (a)-(b) are trivial identification tasks, (c)-(d) follow the mechanical labelling procedure taught in D2, and (e) requires stating a minimum cut. While multi-step, it's a routine examination of a well-practiced algorithm with no novel problem-solving required, making it slightly easier than average.
Spec7.02p Networks: weighted graphs, modelling connections7.04f Network problems: choosing appropriate algorithm

8. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 4} \includegraphics[alt={},max width=\textwidth]{c4c64221-0373-4be9-abe3-5ff281922cdb-07_521_1404_285_343}
\end{figure} The network in Fig. 4 models a drainage system. The number on each arc indicates the capacity of that arc, in litres per second.
  1. Write down the source vertices. \begin{figure}[h]
    \captionsetup{labelformat=empty} \caption{Figure 5} \includegraphics[alt={},max width=\textwidth]{c4c64221-0373-4be9-abe3-5ff281922cdb-07_521_1402_1170_343}
    \end{figure} Figure 5 shows a feasible flow through the same network.
  2. State the value of the feasible flow shown in Fig. 5. Taking the flow in Fig. 5 as your initial flow pattern,
  3. use the labelling procedure on Diagram 1 to find a maximum flow through this network. You should list each flow-augmenting route you use, together with its flow.
  4. Show the maximal flow on Diagram 2 and state its value.
  5. Prove that your flow is maximal.

8.

\begin{figure}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Figure 4}
  \includegraphics[alt={},max width=\textwidth]{c4c64221-0373-4be9-abe3-5ff281922cdb-07_521_1404_285_343}
\end{center}
\end{figure}

The network in Fig. 4 models a drainage system. The number on each arc indicates the capacity of that arc, in litres per second.
\begin{enumerate}[label=(\alph*)]
\item Write down the source vertices.

\begin{figure}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Figure 5}
  \includegraphics[alt={},max width=\textwidth]{c4c64221-0373-4be9-abe3-5ff281922cdb-07_521_1402_1170_343}
\end{center}
\end{figure}

Figure 5 shows a feasible flow through the same network.
\item State the value of the feasible flow shown in Fig. 5.

Taking the flow in Fig. 5 as your initial flow pattern,
\item use the labelling procedure on Diagram 1 to find a maximum flow through this network. You should list each flow-augmenting route you use, together with its flow.
\item Show the maximal flow on Diagram 2 and state its value.
\item Prove that your flow is maximal.
\end{enumerate}

\hfill \mbox{\textit{Edexcel D2 2002 Q8 [14]}}