Assignment: Towards the end of class, we were working on the Assignment Problem Hungarian Algorithm. We added a dummy job and performed row reduction and column reduction, resulting in the matrix table below.
|
12
|
0
|
14
|
0
|
|
0
|
3
|
0
|
0
|
|
5
|
9
|
6
|
0
|
|
2
|
11
|
4
|
0
|
The next step is to find the minimum number of lines to cross out all the zeroes.
1. Systematically choose your row or column and draw the lines to cover the zeros. (Draw lines on the table above andexplainthe procedure clearly.
2. What is the minimum number of lines that you get?
3. Are you at the optimal solution? Explain.