Maximum entropy flows for single-source networks
Tanyimboh, T.T. and Templeman, A.B. (1993) Maximum entropy flows for single-source networks. Engineering Optimization, 22 (1). pp. 49-63. ISSN 0305-215X (https://doi.org/10.1080/03052159308941325)
Preview |
Text.
Filename: Tanyimboh_Templeman_EO_1993_Maximum_entropy_flows_for_single_source_networks.pdf
Accepted Author Manuscript Download (3MB)| Preview |
Abstract
This paper was prompted by growing evidence that Shannon's measure of uncertainty can be used as a surrogate reliability measure for water distribution networks. This applies to both reliability assessment and reliability-governed design. Shannon's measure, however, is a non-linear function of the network flows. Therefore, the calculation of maximum entropy flows requires non-linear programming. Hence a simpler, more accessible method would be most useful. This paper presents an alternative and rigorous method for calculating maximum entropy flows for single-source networks. The proposed method does not involve linear or non-linear programming. Also, it is not iterative. Consequently the method is very efficient. In this paper, the methodology is described, several examples are presented and an algorithm is suggested.
-
-
Item type: Article ID code: 52641 Dates: DateEvent1993PublishedSubjects: Technology > Engineering (General). Civil engineering (General) Department: Faculty of Engineering > Civil and Environmental Engineering Depositing user: Pure Administrator Date deposited: 14 Apr 2015 11:06 Last modified: 27 Mar 2024 01:52 URI: https://strathprints.strath.ac.uk/id/eprint/52641