Assigning order and the Hungarian algorithm
General Mathematics · Unit 4 — Investing and netw orking · Networks and decision mathematics 2
Learning objectives (3)
LO-1Determine the optimum (minimum and maximum) assignment/s for small-scale practical problems by inspection.LO-2Use a bipartite graph and its tabular or matrix form to represent possible assignments for an allocation problem.LO-3Use the Hungarian algorithm (3 × 3 up to 5 × 5 square matrices) to determine the optimum (minimum and maximum) assignment/s for larger practical problems.
Practise these objectives with instant AI marking
Adaptive questions tied to QCAA mark schemes. Free to start.
Start free practice