Multiple Choice
The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means
A) agent 3 can be assigned to 2 tasks.
B) agent 2 can be assigned to 3 tasks.
C) a mixture of agents 1, 2, 3, and 4 will be assigned to tasks.
D) there is no feasible solution.
Correct Answer:
Verified
Correct Answer:
Verified
Q4: The direction of flow in the shortest-route
Q15: Arcs in a transshipment problem<br>A) must connect
Q19: A transshipment problem is a generalization of
Q19: How is the assignment linear program different
Q20: The assignment problem is a special case
Q21: Which of the following is not true
Q23: If a transportation problem has four origins
Q33: The difference between the transportation and assignment
Q39: In a transshipment problem,shipments<br>A)cannot occur between two
Q62: The assignment problem is a special case