FeaturesHow It WorksFor ParentsPricingContactLog inStart free — no credit card needed →

General Mathematics · Unit 4 · Networks and decision mathematics 2 · Assigning order and the Hungarian algorithm

Determine the optimum (minimum and maximum) assignment/s for small-scale practical problems by inspection.

Practise this objective

AI-marked practice questions tied to QCAA mark schemes for this exact LO. Free to start.

Start free practice

Practice questions for this objective

Full questions, answers and worked solutions unlock when you start a free practice session.

Question 1

A small landscaping business assigns three workers (Maya, Jordan, and Alex) to three different garden renovation projects (North, South, and East). The table below shows the time (in hours) each worker needs to complete each project. Use the table to determine the assignment that minimises the total time required to complete all three projects.

Worked answer
🔒 Start free to see full answer
Unlock all 1 answers — free

More in Assigning order and the Hungarian algorithm

Next →
Use a bipartite graph and its tabular or matrix form to represent possible assignments for an allocation problem.
All LOs in Assigning order and the Hungarian algorithmBack to full General Mathematics syllabus