A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation tableau is
A) an optimal solution.
B) an initial feasible solution.
C) a minimum-cost solution.
D) a degenerate solution.
Correct Answer:
Verified
Q5: In assignment problems,dummy agents or tasks are
Q7: The per-unit change in the objective function
Q9: The stepping-stone method requires that one or
Q10: The transportation simplex method can be used
Q12: If a transportation problem has four origins
Q14: The transportation simplex method is limited to
Q15: Optimal assignments are made in the Hungarian
Q16: To handle unacceptable routes in a transportation
Q17: Using the Hungarian method,the optimal solution to
Q27: The difference between the transportation and assignment
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