Multiple Choice
The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means
A) agent 3 can be assigned to two tasks.
B) agent 2 can be assigned to three 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
Q5: The shortest-route problem is a special case
Q6: There are two specific types of problems
Q7: In a capacitated transshipment problem,some or all
Q8: Arcs in a transshipment problem<br>A)must connect every
Q10: The assignment problem is a special case
Q11: Consider a maximal flow problem in which
Q12: In a maximal flow problem,<br>A)the flow out
Q13: The shortest-route problem finds the shortest route<br>A)from
Q14: A plant manager for a sporting goods