Home · Unit 4 · Topic 5

Topic 5: Networks and decision mathematics 2

Flow networks

4 hours

• Understand the meaning of source node, sink node, cut, minimum cut and maximum flow. 1 interactive
• Use a flow network diagram to identify a cut.
• Determine the capacity of a cut.
• Solve small-scale practical problems involving flow networks (up to 8 possible cuts), including determining the minimum cut and the maximum flow.

Assigning order and the Hungarian algorithm

7 hours

• Use a bipartite graph and its tabular or matrix form to represent possible assignments for an allocation problem.
• Determine the optimum (minimum and maximum) assignment/s for small-scale practical problems by inspection.
• Use the Hungarian algorithm (3 × 3 up to 5 × 5 square matrices) to determine the optimum (minimum and maximum) assignment/s for larger practical problems. 1 interactive