Tight MILP formulation for pipeline gas flow with linepack

Journal Article (2025)
Author(s)

T. Klatzer (Graz University of Technology)

S. Wogrin (Graz University of Technology)

D. A. Tejada-Arango (TU Delft - Algorithmics, Universidad Pontificia Comillas, TNO Energy and Materials Transition)

Germán Morales España (TNO Energy and Materials Transition)

Research Group
Algorithmics
DOI related publication
https://doi.org/10.1016/j.ijepes.2025.110734
More Info
expand_more
Publication Year
2025
Language
English
Research Group
Algorithmics
Volume number
169
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In integrated power and gas energy system optimization models (ESOMs), pipeline gas transmission with linepack is a particularly complex problem due to its non-linear and non-convex character. For ESOMs based on mixed-integer linear programming, piecewise linearization is a well-established convexification approach for this problem, which, however, requires binary variables to model feasible combinations of linear gas flow and pressure segments and thus can quickly become computationally challenging. In order to improve computational performance, this paper proposes a piecewise linearization method specifically designed to be tight, resulting in a reduced problem space a solver can explore faster. We provide numerical results comparing the proposed formulation against two piecewise linearizations from the literature, both from a theoretical point of view and in terms of practical computational performance, with results showing an average speed-up of 2.57 times for our case study. Test cases are carried out on a modified 24-bus IEEE Reliability Test System and a 12-node gas system, considering discrete unit commitment decisions.