Sufficient pruning conditions for MINLP in gas network design

  • One-quarter of Europe’s energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euros per kilometer the extension of the European pipeline network is already a multi-billion Euro business. Therefore, automatic planning tools that support the decision process are desired. We model the topology optimization problem in gas networks by a mixed-integer nonlinear program (MINLP). This gives rise to a so-called active transmission problem, a continuous nonlinear non-convex feasibility problem which emerges from the MINLP model by fixing all integral variables. We offer novel sufficient conditions for proving the infeasibility of this active transmission problem. These conditions can be expressed in the form of a mixed-integer program (MILP), i.e., the infeasibility of a non-convex continuous nonlinear program (NLP) can be certified by solving an MILP. This result provides an efficient pruning procedure in a branch-and-bound algorithm. Our computational results demonstrate a substantial speedup for the necessary computations.
Metadaten
Author:Jesco Humpola, Felipe SerranoORCiD
Document Type:Article
Parent Title (English):EURO Journal on Computational Optimization
Volume:5
Issue:1-2
First Page:239
Last Page:261
Publisher:Springer Berlin Heidelberg
Year of first publication:2017
Preprint:urn:nbn:de:0297-zib-53489
DOI:https://doi.org/10.1007/s13675-016-0077-8