Multiple Choice
The figure below shows the nodes (A-I) and capacities (labelled on arcs in packages/day) of a shipping network. The firm would like to know how many packages per day can flow from node A to node I. 
What is the capacity of the connection between nodes B and E?
A) 9 packages/day
B) 11 packages/day
C) 16 packages/day
D) 21 packages/day
E) 26 packages/day
Correct Answer:
Verified
Correct Answer:
Verified
Q3: The figure below shows the possible routes
Q4: The objective of a maximum flow problem
Q5: The figure below shows the nodes (A-I)
Q6: The figure below shows the possible routes
Q7: In a shortest path problem there are
Q9: Any minimum cost flow problem where each
Q10: Any node where the net amount of
Q11: A shortest path problem is required to
Q12: Minimum cost flow problems are the special
Q13: A manufacturing firm has three plants