Review : Systems of Equations — Question 8

PDF ↗

Question 8

Work over the real numbers. Use substitution or elimination, keeping track of conditions under which an operation preserves all solutions. Check candidates in the original equations.

A steady flow network has directed internal flows pp from AA to BB, qq from BB to CC, and rr from CC to AA. External flow enters AA at rate 33; rates 11 and 22 leave BB and CC, respectively. There is no storage. All rates use the same units, and internal flows must be nonnegative.

Tasks

  1. Write the three node-balance equations and identify any redundancy.

  2. Find every nonnegative steady flow and explain why the external data do not determine the internal circulation uniquely.

  3. Impose capacity bounds p≤5p\le 5, q≤4q\le 4 and r≤3r\le 3. Find the entire feasible set and identify which capacities limit it.

  4. Among feasible flows, minimize the cost rate 2p+q+3r2p+q+3r. Prove uniqueness of the minimizer and interpret it in terms of circulation.

Original worksheet page 1: question and worked solution for 5-1-008
Show solutionHide solution

Question 8 – Solution

Strategy. Conservation fixes net transfers but can leave an arbitrary circulating flow around a closed loop.

Step 1: Balance every node. Inflow equals outflow, giving A:r+3=p,B:p=q+1,C:q=r+2.A:\ r+3=p,\qquad B:\ p=q+1,\qquad C:\ q=r+2. Equivalently p−r=3p-r=3, q−p=−1q-p=-1, r−q=−2r-q=-2. The three left sides sum to zero, as do their right sides. Any two balances imply the third because total external inflow equals total external outflow.

Step 2: Recover the free circulation. Set r=tr=t. Then (p,q,r)=(t+3,t+2,t),t≥0.\boxed{(p,q,r)=(t+3,t+2,t),\qquad t\ge 0.} The condition t≥0t\ge 0 is necessary from r≥0r\ge 0 and sufficient for all three flows to be nonnegative. Adding the same amount to all three internal flows preserves every node balance: it is an additional circulation around the loop.

Step 3: Apply all capacities. The bounds give t≤2t\le 2, t≤2t\le 2 and t≤3t\le 3, respectively. Thus the entire feasible family has 0≤t≤2\boxed{0\le t\le 2}. The capacities on pp and qq both limit the upper endpoint; at t=2t=2 they are saturated, while r=2<3r=2<3 leaves unused capacity on the third link.

Step 4: Minimize the cost on the feasible family. Substituting the flow formulas yields 2p+q+3r=2(t+3)+(t+2)+3t=8+6t.2p+q+3r=2(t+3)+(t+2)+3t=8+6t. This increases strictly on [0,2][0,2]. Therefore the unique minimizer is (p,q,r)=(3,2,0)\boxed{(p,q,r)=(3,2,0)}, with cost rate 8\boxed{8}. It sends the required external transfers without an added loop circulation. The diagram shows directions, not arrows scaled in proportion to flow.

See the diagram in the original worksheet below.

Original worksheet page 2: question and worked solution for 5-1-008

Original worksheet layout. Use Enlarge or open the PDF for a closer view.