The problem of determining the flows (and pressures) in the pipes of a general hydraulic network, for given input and output flows and/or given input and output pressure heads, is shown to be equivalent to either of a pair of convex programming problems with linear constraints. This is accomplished via the theory of (generalized) Geometric Programming. The equivalence of these problems is exploited to prove existence and uniqueness of the flow solution under certain conditions as well as to derive an algorithm which calculates this solution. Computational aspects of implementing the algorithm are considered in some detail and results obtained for a general example problem are presented. A brief discussion of the application of the methods of the paper to problems in electrical network analysis, transportation network analysis and the elastic analysis of structural trusses, is also given.
[1]
E. Isaac,et al.
Geography of domestication. Englewood Cliffs, New Jersey, USA, Prentice-Hall, Inc.
,
1970
.
[2]
R. Rockafellar.
Convex programming and systems of elementary monotonic relations
,
1967
.
[3]
W. Prager.
Problems of network flow
,
1965
.
[4]
Claude Berge,et al.
Programming, games and transportation networks
,
1966
.
[5]
Elmor L. Peterson.
Symmetric Duality for Generalized Unconstrained Geometric Programming
,
1970
.
[6]
Colebrook White,et al.
COMPUTER ANALYSIS OF PIPE NETWORKS.
,
1969
.
[7]
Robert K. Brayton,et al.
The Sparse Tableau Approach to Network Analysis and Design
,
1971
.