General Mathematics · Unit 4 · Networks and decision mathematics 2
Worked examples
10 worked examples, each solved step by step with the reasoning behind every move. Try one yourself first, then reveal the working.
Lesson 1Flow networks: sources, sinks and capacities
Open the lesson- Building a flow path by pathSimple familiarWith or without technologyReading flow networks
Lesson 2Cuts and their capacity
Open the lesson- The capacity of a cut with an edge pointing backSimple familiarWith or without technologyCapacity of a cutIdentifying cuts
Lesson 3Minimum cut and maximum flow
Open the lesson- All eight cuts, the minimum cut and the maximum flowComplex familiarWith or without technologyMinimum cut and maximum flowCapacity of a cut
Lesson 4Solving practical flow problems
Open the lesson- Evacuation routes and a road upgradeComplex unfamiliarWith or without technologyFlow network problemsMinimum cut and maximum flow
Lesson 5Allocation problems and bipartite graphs
Open the lesson- Finding an allocation from a bipartite graphFoundationWith or without technologyBipartite graphs and allocation tables
- The quickest allocation by listing every possibilitySimple familiarWith or without technologyAssignment by inspectionBipartite graphs and allocation tables
Lesson 6The Hungarian algorithm for a minimum
Open the lesson- A Hungarian algorithm with no adjustmentSimple familiarWith or without technologyMinimum assignment (Hungarian)Steps of the Hungarian algorithm
- A Hungarian algorithm with an adjustmentComplex familiarWith or without technologyMinimum assignment (Hungarian)Steps of the Hungarian algorithm
Lesson 7Maximum assignments and more than one optimum
Open the lesson- A maximum assignment for sales regionsComplex familiarWith or without technologyMaximum assignment
- A problem with two optimal assignmentsComplex unfamiliarWith or without technologyMinimum assignment (Hungarian)Steps of the Hungarian algorithm