The assignment problem is equivalent to a transportation problem with
A) the sums of all rows and columns equal to one.
B) binary decision variables.
C) non-negativity constraints removed.
D) all of the above.

Question

Quizplus · Accepted Answer

The assignment problem is a special case of the transportation problem where all supply and demand quantities are equal to one. Therefore, it has binary decision variables, and non-negativity constraints are not applicable. Additionally, the sums of all rows and columns must be equal to one in the assignment problem, making all of the given choices correct.

The Assignment Problem Is Equivalent to a Transportation Problem with