OCR D2 2015 June — Question 5 10 marks

Exam BoardOCR
ModuleD2 (Decision Mathematics 2)
Year2015
SessionJune
Marks10
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicNetwork Flows
TypeComplete labelling procedure initialization
DifficultyModerate -0.3 This is a standard max-flow problem using the labelling procedure with straightforward parts: reading current flows from a diagram, finding an augmenting path, and verifying maximality with a cut. While it requires understanding of network flow concepts and careful bookkeeping across multiple parts, it follows the standard D2 algorithm without requiring novel insight or complex problem-solving beyond textbook procedures.
Spec7.02p Networks: weighted graphs, modelling connections7.04a Shortest path: Dijkstra's algorithm

5 The diagram shows a flow through a network of directed arcs. The amount that can flow in each arc is limited by its upper capacity, and the lower capacity of each arc is 0 . The labelled arrows by the arcs show how much more (excess capacity) and how much less (potential backflow) could flow in each arc, in litres per second, and the objective is to find the maximum flow from \(S\) to \(T\). \includegraphics[max width=\textwidth, alt={}, center]{b3a3d522-2ec9-46ec-bd99-a8c698e3d1c0-6_969_1363_459_351}
  1. How many litres per second are currently flowing along the route SACHT?
  2. How many litres per second are currently flowing from \(S\) to \(T\) ?
  3. What is the maximum by which the flow along the route SBGIT can be increased? Use the copy of the network in your answer book to show what happens to the labels on the arrows when the flow along this route is augmented by this amount.
  4. Find the maximum amount that can flow through the network. Explain, by using a cut, how you know that your flow is a maximum. The network had vertices \(S , A , B , C , D , E , F , G , H , I\) and \(T\). The single vertex \(E\) is replaced by the pair of vertices \(E _ { 1 }\) and \(E _ { 2 }\), together with the \(\operatorname { arc } E _ { 1 } E _ { 2 }\).
  5. What does the \(\operatorname { arc }\) joining \(E _ { 1 }\) and \(E _ { 2 }\) tell you about the flow at \(E\) ?
  6. Complete the diagram in your answer book to show the flow resulting after part (iii) on a directed network with vertices \(S , A , B , C , D , E , F , G , H , I\) and \(T\).

5 The diagram shows a flow through a network of directed arcs. The amount that can flow in each arc is limited by its upper capacity, and the lower capacity of each arc is 0 . The labelled arrows by the arcs show how much more (excess capacity) and how much less (potential backflow) could flow in each arc, in litres per second, and the objective is to find the maximum flow from $S$ to $T$.\\
\includegraphics[max width=\textwidth, alt={}, center]{b3a3d522-2ec9-46ec-bd99-a8c698e3d1c0-6_969_1363_459_351}\\
(i) How many litres per second are currently flowing along the route SACHT?\\
(ii) How many litres per second are currently flowing from $S$ to $T$ ?\\
(iii) What is the maximum by which the flow along the route SBGIT can be increased? Use the copy of the network in your answer book to show what happens to the labels on the arrows when the flow along this route is augmented by this amount.\\
(iv) Find the maximum amount that can flow through the network. Explain, by using a cut, how you know that your flow is a maximum.

The network had vertices $S , A , B , C , D , E , F , G , H , I$ and $T$. The single vertex $E$ is replaced by the pair of vertices $E _ { 1 }$ and $E _ { 2 }$, together with the $\operatorname { arc } E _ { 1 } E _ { 2 }$.\\
(v) What does the $\operatorname { arc }$ joining $E _ { 1 }$ and $E _ { 2 }$ tell you about the flow at $E$ ?\\
(vi) Complete the diagram in your answer book to show the flow resulting after part (iii) on a directed network with vertices $S , A , B , C , D , E , F , G , H , I$ and $T$.

\hfill \mbox{\textit{OCR D2 2015 Q5 [10]}}