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. 
Note: This question requires Solver.
Formulate the problem in Solver and find the optimal solution. At maximum capacity, what will be the flow 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
Q24: A transportation problem is just a minimum
Q25: A manufacturing firm has three plants
Q26: Which of the following is not an
Q27: The amount of flow that is eventually
Q28: Which of the following is an example
Q30: The network simplex method can aid managers
Q31: The figure below shows the nodes (A-I)
Q32: Conservation of flow is achieved when the
Q33: In a minimum cost flow problem, the
Q34: In a minimum cost flow problem there