Edexcel D1 2002 November — Question 7

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2002
SessionNovember
TopicNetwork Flows

7. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 4} \includegraphics[alt={},max width=\textwidth]{438a62e6-113c-428e-85bf-4b1cbecee0de-6_523_1404_348_345}
\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]{438a62e6-113c-428e-85bf-4b1cbecee0de-6_525_1404_1233_345}
    \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.
    (6)
  4. Show the maximal flow on Diagram 2 and state its value.
  5. Prove that your flow is maximal.