Picture of UK Houses of Parliament

Leading national thinking on politics, government & public policy through Open Access research

Strathprints makes available scholarly Open Access content by researchers in the School of Government & Public Policy, based within the Faculty of Humanities & Social Sciences.

Research here is 1st in Scotland for research intensity and spans a wide range of domains. The Department of Politics demonstrates expertise in understanding parties, elections and public opinion, with additional emphases on political economy, institutions and international relations. This international angle is reflected in the European Policies Research Centre (EPRC) which conducts comparative research on public policy. Meanwhile, the Centre for Energy Policy provides independent expertise on energy, working across multidisciplinary groups to shape policy for a low carbon economy.

Explore the Open Access research of the School of Government & Public Policy. Or explore all of Strathclyde's Open Access research...

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

Text (Tanyimboh-Templeman-EO-1993-Maximum-entropy-flows-for-single-source-networks)
Accepted Author Manuscript

Download (3MB)| Preview


    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.