Machine-translated by Google. Questions are authored in English.
Top

Discussion

The optimal solution of the following assignment problem using Hungarian method is

IIIIIIIV
A8261711
B1328426
C38191815
D19262410

(A) (B) (C) (D)

  • A.(I) (II) (III) (IV)
  • B.(I) (III) (II) (IV)
  • C.(I) (III) (IV) (II)
  • D.(I) (IV) (II) (III)

Answer: B

The best assignment is the one with the least total cost. In option (B), A goes to I at cost 8, B to III at 4, C to II at 19 and D to IV at 10, a total of 41. The other assignments cost more, for example A-I, B-III, C-IV, D-II costs 8 + 4 + 15 + 26 = 53, and A-II, B-III, C-IV, D-I costs 26 + 4 + 15 + 19 = 64, and option (A) with the diagonal costs 8 + 28 + 18 + 10 = 64. So the Hungarian method gives the assignment of option (B), with the cost 41.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.