energy conversion systems cogeneration plant mixed-integer-nonlinear programming Branch and Cut global optimization LaGO - a (heuristic) Branch and Cut algorithm for nonconvex MINLPs Turang Ahadi-Oskui Ahadi-Oskui Turang Stefan Vigerske Vigerske Stefan Ivo Nowak Nowak Ivo Georgios Tsatsaronis Tsatsaronis Georgios Institut für Mathematik, Humboldt-Universität zu Berlin (ISSN 0863-0976), 20

Optimizing the design of complex energy conversion systems by Branch and Cut

Turang Ahadi-Oskui, Stefan Vigerske, Ivo Nowak, Georgios Tsatsaronis

Preprint series: Institut für Mathematik, Humboldt-Universität zu Berlin (ISSN 0863-0976), 20

MSC 2000

90C26 Nonconvex programming
90C59 Approximation methods and heuristics

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. Thus, the optimization problem is formulated as a highly non-convex 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.

This document is well-formed XML.