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?
Definitions:
Matching
An accounting principle where expenses are recorded in the period they are incurred to generate revenues.
Ending Inventory
The total value of goods available for sale at the end of an accounting period.
Cost of Goods Sold
The direct costs attributable to the production of the goods sold by a company.
LIFO
A method of inventory valuation called "Last-In, First-Out," where the most recently acquired items are the first to be expensed.
Q4: The discovery of the simplex method in
Q6: Two people who face the same problem
Q24: If we have a narrow perspective of
Q24: A single bay car wash with an
Q43: Given forecast errors of −5, -10, and
Q44: If the change to a right-hand side
Q45: A manufacturing firm has four plants
Q57: A risk-averse decision maker is trying
Q58: Service times at a doctor's office take
Q63: An optimal solution is only optimal with