1.

The optimal solution is found in an assignment matrix when the minimum number of straightlines 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.


Discussion

No Comment Found