MCQ
Using the Hungarian method the optimal assignment obtained for the following assignment problem to minimize the total cost is:
| AGENT | JOB | |||
| A | B | C | D | |
| 1 | 10 | 12 | 15 | 25 |
| 2 | 14 | 11 | 19 | 32 |
| 3 | 18 | 21 | 23 | 29 |
| 4 | 15 | 20 | 26 | 28 |
- ✓$1- C , 2- B , 3- D , 4- A$
- B$1- B , 2- C , 3- A , 4- D$
- C$1- A , 2- B , 3- C _1 4- D$
- D$1- D , 2- A , 3- B , 4- C$