Pages in this set

Page 1

Preview of page 1
HUNGARIAN ALGORITHM (Allocation) AQA Spec.

Hungarian Algorithm

Used for allocation problems
Usually possible to match any 'person' to any 'task'
There is a 'cost' associated with each matching

The Algorithm:

1. Find the opportunity cost matrix

2. Test for an optimal assignment

3. Revise the opportunity cost matrix and return…

Page 2

Preview of page 2
Is It Optimal?
Find the minimum number of lines needed to
21 0 11 3 cover all of the `0's in your opportunity cost
matrix.
3 0 5 15 (There may be different ways of doing this.)

11 0 0 2 We want this number to equal the number of…

Comments

daviesg

Report

Excellent presentation for the hungarian allocation (AQA D2)

Similar Mathematics resources:

See all Mathematics resources »