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).

Question

Quizplus · Accepted Answer

In the assignment problem, the optimal solution is found when the minimum number of lines needed to cover all the zeros in the cost matrix equals the number of agents (or tasks), according to the Hungarian algorithm.

The Optimal Solution Is Found in an Assignment Matrix When