D2.2.2 Formulation of the Hungarian algorithm as a linear programming…

Section
D2.2 Allocation (assignment) problems
Level
A level only
Statement
Formulation of the Hungarian algorithm as a linear programming problem.
Since 2018
2 parts, 12 marks · topic pages: Allocation (assignment) problems and the Hungarian algorithm

Back to the checklist

June 2024 · Paper 4D (Decision 2) · Q4(b) 6 marks
(b) Formulate the above situation as a linear programming problem. You must define the decision variables and make the objective function and constraints clear. (6)
Nov 2021 · Paper 4D (Decision 2) · Q1 6 marks
1. Four workers, A, B, C and D, are to be assigned to three tasks, 1, 2 and 3. Each task must be assigned to just one worker and each worker can do one task only. Worker A cannot do task 2 and worker D cannot do task 3 The cost of assigning each worker to each task is shown in the table below. The total cost is to be minimised. A – B C – Formulate the above situation as a linear programming problem. You must define your decision variables and make the objective function and constraints clear. (6)

Find an Edexcel Further Maths tutor

Stuck on this? Book a trial lesson with our Further Maths tutor.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.