Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-25T09:05:01.846Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal diameter assignment for gas pipeline networks

Published online by Cambridge University Press:  17 February 2009

Sita Bhaskaran  and
Franz J. M. Salzborn
Franz J. M. Salzborn
Affiliation:
Department of Applied Mathematics, University of Adelaide, Adelaide, S.A. 5001, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A linear programming model for optimally assigning diameters to a gas pipeline network is discussed. Computational results for a real life situation are presented, and certain properties that have to be satisfied by an optimal assignment are derived.

Type
Research Article
Information
The ANZIAM Journal , Volume 21 , Issue 2 , August 1979 , pp. 129 - 144
Copyright
Copyright © Australian Mathematical Society 1979

References

[1]Bhaskaran, S., Optimal design of gas pipeline networks (Ph.D. Thesis, University of Adelaide, 05 1978).Google Scholar
[2]Bhaskaran, S. and Salzborn, F. J. M., “Optimal design of gas pipeline networks”, submitted for publication to J. Operational Res. Soc.Google Scholar
[3]Frank, H. and Frisch, I. T., Communication, transmission and transportation networks (Addison—Wesley, Reading, Mass., 1971).Google Scholar
[4]Frank, H., Frisch, I. T., van Slyke, R. and Chon, W. S., “Optimal design of centralized computer networks”, Networks 1 (1972), 53–57.Google Scholar
[5]Rothfarb, B., Frank, H., Rosenbaum, D. M., Steiglitz, K. and Kleitman, D. J., “Optimal design of offshore national gas pipeline systems”, Operations Research 18 (1970), 351–365.Google Scholar
[6]Stephenson, D., Pipeline design for water engineers (Elsevier, New York, 1976), Chapter 3.Google Scholar
[7]Zadeh, N., “Construction of efficient tree networks: the pipeline problem”, Networks 3 (1973), 1–31.Google Scholar