Application to Network Flow

There are many types of problems that concern a network of conductors along which some sort of flow is observed. Examples of these include an irrigation network and a network of streets or freeways. There are often points in the system at which a net flow either enters or leaves the system. The basic principle behind the analysis of such systems is that the total flow into the system must equal the total flow out. In fact, we apply this principle at every junction in the system.

This requirement gives a linear equation relating the flows in conductors emanating from the junction.

Practice Problems

Find the possible flows in each of the following networks of pipes.
(a)

(b)

Click the arrow to see the answer.

, , parameters

A proposed network of irrigation canals is described in the accompanying diagram. At peak demand, the flows at interchanges , , , and are as shown.

(a)
Find the possible flows.
(b)
If canal is closed, what range of flow on must be maintained so that no canal carries a flow of more than 30?

Click the arrow to see the answer.

A traffic circle has five one-way streets, and vehicles enter and leave as shown in the accompanying diagram.

(a)
Compute the possible flows.
(b)
Which road has the heaviest flow?
AB BC CD DE EA

Text Source

This application was adapted from Section 1.4 of Keith Nicholson’s Linear Algebra with Applications. (CC-BY-NC-SA)

W. Keith Nicholson, Linear Algebra with Applications, Lyryx 2018, Open Edition, p. 27