Maximum entropy flows for single-source networks

Maximum entropy flows for single-source networks

0.00 Avg rating0 Votes
Article ID: iaor19941571
Country: Switzerland
Volume: 22
Issue: 1
Start Page Number: 49
End Page Number: 63
Publication Date: Nov 1993
Journal: Engineering Optimization
Authors: ,
Keywords: quality & reliability, optimization, water
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.

Reviews

Required fields are marked *. Your email address will not be published.