use a bipartite graph and its tabular or matrix form to represent an assignment/allocation problem, e.g. assigning four swimmers to the four places in a medley relay team to maximise the team’s chances of winning
4.3.4.2
determine the optimum assignment/s for small-scale problems by inspection, or by use of the Hungarian algorithm (3 × 3) for larger problems
