Multiple Choice
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) .
Correct Answer:

Verified
Correct Answer:
Verified
Q2: The net evaluation index for occupied cells
Q3: The stepping-stone method requires that one or
Q4: After some special presentations, the employees
Q7: Use the Hungarian method to obtain
Q10: Canning Transport is to move goods
Q11: Four jobs must be assigned to
Q13: The transportation simplex method can be used
Q22: Explain how the Hungarian method can be
Q27: For an assignment problem where the number
Q29: In assignment problems,dummy agents or tasks are