Network
Flow
Supplements

Networks are especially convenient
for modeling because of their simple nonmathematical structure that can
be easily depicted with a graph. This simplicity also reaps benefits with
regard to algorithmic efficiency. Although the simplex method of linear
programming is one of the primary solution techniques, we have already seen
that its implementation for network problems allows many procedural simplifications.
Small instances can be solved by hand and computer programs are available
for solving very large instances much faster than standard simplex codes.
This section provides a solution algorithm for the pure network flow programming
problem on a directed graph.

Updated
2/1/00
Operations Research Models and Methods
by Paul A. Jensen and Jon Bard, University of Texas, Copyright
by the Authors