Network Flow Problems
Many linear programming problems can be viewed as a problem of minimizing the “transportation” cost of moving materials through a network to meet demands for material at various locations given sources of material at other locations. Such problems are called networkflow problems. They form the most important special class of linear programming problems. Transportation, electric, and communication networks provide obvious examples of application areas. Less obvious, but just as important, are applications in facilities location, resource management, financial planning, and others.
KeywordsSpan Tree Tree Solution Linear Programming Problem Simplex Method Dual Variable
Unable to display preview. Download preview PDF.
- Bazaraa, M., Jarvis, J., and Sherali, H. (1977), Linear Programming and Network Flows, 2 edn, Wiley, New York. 11, 240Google Scholar
- Ahuja, R., Magnanti, T., and Orlin, J. (1993), Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ. 240, 257Google Scholar
- Dantzig, G. (1951a), Application of the simplex method to a transportation problem, in T. Koopmans, ed., `Activity Analysis of Production and Allocation’, John Wiley and Sons, New York, pp. 359–373. 10, 240Google Scholar
- Ford, L., and Fulkerson, D. (1958), `Constructing maximal dynamic flows from static flows’, Operations Research 6, 419–433. 240Google Scholar