1.

The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals

A. (the number of agents) 1.
B. (the number of agents).
C. (the number of agents) + 1
D. (the number of agents) + (the number of tasks).
Answer» C. (the number of agents) + 1


Discussion

No Comment Found