Using the Hungarian method,the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the number of agents.
Correct Answer:
Verified
Q12: The transportation simplex method is a two-phase
Q13: The transportation simplex method can be applied
Q14: The transportation simplex method is limited to
Q15: Optimal assignments are made in the Hungarian
Q16: To handle unacceptable routes in a transportation
Q18: An example of a heuristic is the
A)minimum
Q19: In the transportation simplex method,when total supply
Q20: A dummy origin in a transportation problem
Q21: In order to identify the arc that
Q22: Five customers needing their tax returns prepared
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents