Multiple Choice
The figure below shows the nodes (A-I) and capacities (labelled on arcs in TB/s) of a computer network. The firm would like to know how much information 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 data flow between nodes F and H?
A) 3 TB/s
B) 4 TB/s
C) 10 TB/s
D) 14 TB/s
E) 15 TB/s
Correct Answer:
Verified
Correct Answer:
Verified
Q61: In a feasible minimum cost flow problem,
Q62: In a shortest path problem, the lines
Q63: The objective of a minimum cost flow
Q64: A manufacturing firm has three plants
Q65: The network simplex method can be used
Q67: A minimum cost flow problem may be
Q68: A manufacturing firm has four plants
Q69: Which of the following could be the
Q70: A manufacturing firm has four plants
Q71: Which of the following is not an