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. What is the maximum amount of data that can be transmitted from node A to node I?
Definitions:
Economic Profit
The difference between total revenue and total costs, including both explicit and implicit costs, indicating the financial gain that exceeds opportunity costs.
Perfect Competitor
A firm in a perfectly competitive market, having no control over market price and where goods offered are perfect substitutes.
Differentiated Product
A product that has been designed or marketed to stand out from similar products offered by competitors.
Elastic
Refers to the responsiveness of the quantity demanded or supplied of a good or service to a change in its price.
Q17: The university is scheduling cleaning crews
Q33: In a minimum cost flow problem, the
Q33: Unintentional media effects<br>A) only happen when we
Q44: Which of the following actions will toggle
Q45: The owner of Crackers, Inc. produces both
Q50: A system has one service facility that
Q53: Forecasts can help a manager to:<br>A) anticipate
Q59: When using the graphical method, the region
Q73: The Solver report that shows the allowable
Q73: The figure below shows the possible routes