Solving the Pipe Network Analysis Problem Using Optimization Techniques

M. Collins, L. Cooper, R. Helgason, J. Kennington and L. LeBlanc
Additional contact information
M. Collins: Southern Methodist University
L. Cooper: Southern Methodist University
R. Helgason: Southern Methodist University
J. Kennington: Southern Methodist University
L. LeBlanc: Southern Methodist University

Management Science, 1978, vol. 24, issue 7, 747-760

Abstract: For more than forty years, approximate solutions for the classical pipe network analysis problem have been obtained by direct solution of the nonlinear stationary point conditions. We propose a revolutionary new approach involving optimization techniques for solving this well-known engineering problem. It is shown that the pipe network analysis problem may be described mathematically in terms of a nonlinear convex cost network flow problem. Three mathematical programming algorithms for solving this problem have been coded and are computationally compared with a code using the traditional Newton-Raphson technique. The computational experience demonstrates that this new approach provides an attractive alternative for solving this important problem.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.7.747 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:24:y:1978:i:7:p:747-760

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().