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
Q15: A professor has been contacted by four
Q16: Solve the following transportation problem using the
Q17: Explain what adjustments are made to the
Q18: The following table shows the unit shipping
Q20: Using the transportation simplex method, the optimal
Q21: If a transportation problem has four origins
Q22: Explain how the Hungarian method can be
Q23: After some special presentations, the employees of
Q33: The difference between the transportation and assignment
Q51: A dummy origin in a transportation problem