The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals
A) number of agents − 1.
B) number of agents.
C) number of agents + 1.
D) number of agents + number of tasks.
Correct Answer:
Verified
Q1: Finding an initial feasible solution can be
Q3: For an assignment problem with three agents
Q4: The net evaluation index for occupied cells
Q5: In assignment problems,dummy agents or tasks are
Q6: A solution to a transportation problem that
Q7: The per-unit change in the objective function
Q8: The difference between the transportation and assignment
Q9: The stepping-stone method requires that one or
Q10: The transportation simplex method can be used
Q11: The transportation simplex method is more efficient
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