Question: 39. Given five managers i = R,S,T,U,V and five projects j = A,B,C,D,E with the following Minimization Assignment table, solve the assignment problem via Hungarian
39. Given fivemanagers i = R,S,T,U,V and five projects j = A,B,C,D,E with the following Minimization Assignment table, solve the assignment problem via Hungarian Method.
| 26 | 36 | 40 | 30 | 28 |
| 18 | 50 | 34 | 40 | 22 |
| 28 | 40 | 30 | 42 | 20 |
| 20 | 30 | 36 | 32 | 16 |
| 26 | 24 | 22 | 20 | 28 |
Based on the Hungarian method, what should be theMinimum Z* value?
Keep your written work.
Select one:
a. 120b. 116c. 118d. 112e. 114
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
