Optimizing the design of complex energy conversion systems by Branch and Cut
Please always quote using this URN:urn:nbn:de:0296-matheon-9814
- The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based cogeneration plant. The optimization problem is formulated as a nonconvex mixed-integer nonlinear problem (MINLP) and solved by the MINLP solver LaGO. The algorithm generates a convex relaxation of the MINLP and applies a Branch and Cut algorithm to the relaxation. Numerical results for different demands for electric power and process steam are discussed and a sensitivity analysis is performed.
Download full text files
Additional Services
| Author: | Stefan Vigerske |
|---|---|
| URN: | urn:nbn:de:0296-matheon-9814 |
| Referee: | Werner Römisch |
| Document Type: | Preprint, Research Center Matheon |
| Language: | English |
| Date of first Publication: | 2012/01/16 |
| Release Date: | 2012/01/16 |
| Tag: | Cogeneration plant; Convex relaxation; Energy conversion system; Global optimization; Mixed-integer nonlinear programming |
| Institute: | Humboldt-Universität zu Berlin |
| Technische Universität Berlin | |
| MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C26 Nonconvex programming, global optimization |
| Preprint Number: | 860 |
