All mind maps topics

Augmenting flows and refinementsAQA A-Level Further Maths: Mind map

Augmenting
Proving maximal

Augmenting flows

and refinements

augmentboundsnode limits
Upper and lower
Restricted nodes
Evaluating changes

Exam questions on Augmenting flows and refinements

  1. A network has source SS, sink TT and nodes AA and BB. The directed arcs and their capacities are SASA 6, SBSB 3, ABAB 5, ATAT 3 and BTBT 4. An initial flow of 4 units is sent along the route S→A→B→TS\to A\to B\to T.
    Show how the flow of 6 can be increased further, and prove that the resulting flow is a maximum.2 marks
  2. Water flows from a source SS to a sink TT through junctions AA and BB. Each pipe has a lower and an upper limit on its flow, in litres per second, written [lower,upper][\text{lower},\text{upper}]: SASA [3,8][3,8], SBSB [2,5][2,5], ABAB [1,4][1,4], ATAT [4,7][4,7] and BTBT [3,6][3,6]. Water flows in the direction of each arc.
    Show that the value of every feasible flow is at least 7 litres per second.2 marks
  3. A sorting centre network has source SS, sink TT and nodes AA, BB and CC. The directed arcs and their capacities (parcels per hour, in thousands) are SASA 8, SBSB 7, ABAB 4, ACAC 5, BCBC 6, BTBT 5 and CTCT 9. Node BB can handle at most 6 thousand parcels per hour in total.
    Explain how the network can be modified to include the restriction on node BB.3 marks
See the full worksheet

Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).