How to write a linear equation that describes this image of flow of traffic along the various branches. How to use these equations to determine the minimum flow possible along x1. What are the other flows at that time ?
Begining from left and supposing that the flow is a continuous flow,
Applying Kirchoff's law to each knot,
Note that by making
The minimization problem can be stated as a linear programming problem:
The solution follows