Question

3. (a) Four workers A, B, C, D are to be assigned four tasks (K, L, M, N). Each worker must only be assigned one task and each task can only be completed by a single worker. The cost, in £, for allocating each worker to each task is shown in Table 2. Table 2 (£) K L M N A 36 52 49 28 B 44 46 42 43 C 50 38 45 48 D 40 49 43 47 i. Use the Hungarian Algorithm to find the optimum allocation. State the minimum cost. (4 marks) ii. Sketch a bipartite graph to show what task each worker is to complete. (2 marks) (b) A transport company are reviewing their practices and are looking for a minimum cost solution. Table 3 shows the cost, in £, for transporting one pallet of stock from each of the suppliers A, B, C to four separate warehouses W, X, Y and Z. The table also includes the stock held by each supplier and the stock required at each warehouse.

          3. (a) Four workers A, B, C, D are to be assigned four tasks (K, L, M, N). Each
worker must only be assigned one task and each task can only be completed
by a single worker. The cost, in £, for allocating each worker to each task is
shown in Table 2.
Table 2 (£)
K
L
M
N
A
36
52
49
28
B
44
46
42
43
C
50
38
45
48
D
40
49
43
47
i. Use the Hungarian Algorithm to find the optimum allocation. State the
minimum cost.
(4 marks)
ii. Sketch a bipartite graph to show what task each worker is to complete.
(2 marks)
(b) A transport company are reviewing their practices and are looking for a
minimum cost solution.
Table 3 shows the cost, in £, for transporting one pallet of stock from each of
the suppliers A, B, C to four separate warehouses W, X, Y and Z. The table
also includes the stock held by each supplier and the stock required at each
warehouse.

3. (a) Four workers A, B, C, D are to be assigned four tasks (K, L, M, N). Each
worker must only be assigned one task and each task can only be completed
by a single worker. The cost, in £, for allocating each worker to each task is
shown in Table 2.
Table 2 (£)
K
L
M
N
A
36
52
49
28
B
44
46
42
43
C
50
38
45
48
D
40
49
43
47
i. Use the Hungarian Algorithm to find the optimum allocation. State the
minimum cost.
(4 marks)
ii. Sketch a bipartite graph to show what task each worker is to complete.
(2 marks)
(b) A transport company are reviewing their practices and are looking for a
minimum cost solution.
Table 3 shows the cost, in £, for transporting one pallet of stock from each of
the suppliers A, B, C to four separate warehouses W, X, Y and Z. The table
also includes the stock held by each supplier and the stock required at each
warehouse.

Added by Karen M.

Question

Please give Ace some feedback