This paper considers the analysis of process networks with bottlenecks and
shows how they may be regarded as simple multi-source maximal flow linear p
rogramming problems. We surveyed over 30 Production/Operations Management a
nd management science/OR textbooks, finding that only iterative trial-and-e
rror procedures are now being suggested for this kind of analysis. The maxi
mal flow network approach is easier for complex problems and also allows se
veral advantages not available in the trial-and-error approaches. This pape
r also discusses the use of a simple linear programming sensitivity result
called radial change. The modelling approach suggested here can provide new
ideas for improving system capacity following the application of Theory of
Constraints techniques.