Network flow algorithms have been developed to handle a special class of linear programming problems. These problems may each be described by a network whose links carry flow. Network algorithms take advantage of this special structure to produce an optimal solution much more quickly, with less storage required, and with virtually no round off error in comparison with general linear programming codes. The objective of this paper is to introduce the reader to the basic ideas involved in formulating a network problem, and to explain in a non-technical manner what the "out-of-kilter" network algorithm (1) does . This algorithm is very general and extremely efficient in solving network flow cost problems (as opposed to CPM, PERT, and GERT type networks).
/lp/association-for-computing-machinery/an-out-of-kilter-network-tutorial-4400U0EOPS