Natural Gas Flow Solvers Using Convex Relaxation
- 10 February 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 7 (3) , 1283-1295
Abstract
The vast infrastructure development, gas flow dynamics, and complex interdependence of gas with electric power networks call for advanced computational tools. Solving the equations relating gas injections to pressures and pipeline flows lies at the heart of natural gas network (NGN) operation, yet existing solvers require careful initialization and uniqueness has been an open question. In this context, this work considers the nonlinear steady-state version of the gas flow (GF) problem. It first establishes that the solution to the GF problem is unique under arbitrary NGN topologies, compressor types, and sets of specifications. For GF setups where pressure is specified on a single (reference) node and compressors do no appear in cycles, the GF task is posed as an convex minimization. To handle more general setups, a GF solver relying on a mixed-integer quadratically-constrained quadratic program (MI-QCQP) is also devised. This solver can be used for any GF setup at any NGN. It introduces binary variables to capture flow directions; relaxes the pressure drop equations to quadratic inequality constraints; and uses a carefully selected objective to promote the exactness of this relaxation. The relaxation is provably exact in NGNs with non-overlapping cycles and a single fixed-pressure node. The solver handles efficiently the involved bilinear terms through McCormick linearization. Numerical tests validate our claims, demonstrate that the MI-QCQP solver scales well, and that the relaxation is exact even when the sufficient conditions are violated, such as in NGNs with overlapping cycles and multiple fixed-pressure nodes.Keywords
All Related Versions
Funding Information
- National Science Foundation (1711587)
This publication has 23 references indexed in Scilit:
- Convex Relaxations for Gas Expansion PlanningINFORMS Journal on Computing, 2016
- Coordinated Scheduling for Interdependent Electric Power and Natural Gas InfrastructuresIEEE Transactions on Power Systems, 2016
- Convex Optimization for Joint Expansion Planning of Natural Gas and Power Systems2016
- Monotonicity of dissipative flow networks renders robust maximum profit problem tractable: General analysis and application to natural gas flows2015
- Optimization problems in natural gas transportation systems: A state-of-the-art reviewApplied Energy, 2015
- Optimal Compression in Natural Gas Networks: A Geometric Programming ApproachIEEE Transactions on Control of Network Systems, 2014
- Combinatorial Optimization2012
- The Gas Transmission Problem Solved by an Extension of the Simplex AlgorithmManagement Science, 2000
- Unsteady and transient flow of compressible fluids in pipelines—a review of theoretical and some experimental studiesInternational Journal of Heat and Fluid Flow, 1987
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problemsMathematical Programming, 1976