Abstract
This paper is concerned with the optimal dimensioning problem in which the layout of a pipe network is given but several available diameters can be selected for each pipe. The purpose is to minimize total cost while satisfying certain restrictions. A new method is proposed, the main features of which are to treat the problem as a bilevel programming problem, then to simplify the lower level problem by conjugate duality theory and to handle the upper level problem by its piecewise linear and convex nature. Some numerical testing results are also presented.
| Original language | English |
|---|---|
| Pages (from-to) | 838-857 |
| Journal | SIAM Journal on Optimization |
| Volume | 6 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Aug 1996 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Bilevel programming
- Conjugate dual
- Convex programming
- Pipe network
- Trust region method
Fingerprint
Dive into the research topics of 'A bilevel programming method for pipe network optimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver