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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jesco Humpola, Felipe Serrano
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2017
Materias:	90C11 90C26 90C30 90C90 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/abe7b9ed23354cc5960221c00f5ec4cc
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:abe7b9ed23354cc5960221c00f5ec4cc
record_format	dspace
spelling	oai:doaj.org-article:abe7b9ed23354cc5960221c00f5ec4cc2021-12-02T05:01:00ZSufficient pruning conditions for MINLP in gas network design2192-440610.1007/s13675-016-0077-8https://doaj.org/article/abe7b9ed23354cc5960221c00f5ec4cc2017-03-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000800https://doaj.org/toc/2192-4406One-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.Jesco HumpolaFelipe SerranoElsevierarticle90C1190C2690C3090C90Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 5, Iss 1, Pp 239-261 (2017)
institution	DOAJ
collection	DOAJ
language	EN
topic	90C11 90C26 90C30 90C90 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90C11 90C26 90C30 90C90 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Jesco Humpola Felipe Serrano Sufficient pruning conditions for MINLP in gas network design
description	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.
format	article
author	Jesco Humpola Felipe Serrano
author_facet	Jesco Humpola Felipe Serrano
author_sort	Jesco Humpola
title	Sufficient pruning conditions for MINLP in gas network design
title_short	Sufficient pruning conditions for MINLP in gas network design
title_full	Sufficient pruning conditions for MINLP in gas network design
title_fullStr	Sufficient pruning conditions for MINLP in gas network design
title_full_unstemmed	Sufficient pruning conditions for MINLP in gas network design
title_sort	sufficient pruning conditions for minlp in gas network design
publisher	Elsevier
publishDate	2017
url	https://doaj.org/article/abe7b9ed23354cc5960221c00f5ec4cc
work_keys_str_mv	AT jescohumpola sufficientpruningconditionsforminlpingasnetworkdesign AT felipeserrano sufficientpruningconditionsforminlpingasnetworkdesign
_version_	1718400847103131648

Sufficient pruning conditions for MINLP in gas network design

Ejemplares similares