Natural Gas Flow Equations: Uniqueness and an MI-SOCP Solver

The critical role of gas fired-plants to compensate renewable generation has increased the operational variability in natural gas networks (GN). Towards developing more reliable and efficient computational tools for GN monitoring, control, and planning, this work considers the task of solving the nonlinear equations governing steady-state flows and pressures in GNs. It is first shown that if the gas flow equations are feasible, they enjoy a unique solution. To the best of our knowledge, this is the first result proving uniqueness of the steady-state gas flow solution over the entire feasible domain of gas injections. To find this solution, we put forth a mixed-integer second-order cone program (MI-SOCP)-based solver relying on a relaxation of the gas flow equations. This relaxation is provably exact under specific network topologies. Unlike existing alternatives, the devised solver does not need proper initialization or knowing the gas flow directions beforehand, and can handle gas networks with compressors. Numerical tests on tree and meshed networks indicate that the relaxation is exact even when the derived conditions are not met.

[1]  Alper Atamtürk,et al.  Conic mixed-integer rounding cuts , 2009, Math. Program..

[2]  Roger Z. Ríos-Mercado,et al.  Optimization problems in natural gas transportation systems. A state-of-the-art review , 2015 .

[3]  Russell Bent,et al.  Convex Relaxations for Gas Expansion Planning , 2015, INFORMS J. Comput..

[4]  Ross Baldick,et al.  Solving the natural gas flow problem using semidefinite program relaxation , 2017, 2017 IEEE Power & Energy Society General Meeting.

[5]  C. R. Fuerte-Esquivel,et al.  A Unified Gas and Power Flow Analysis in Natural Gas and Electricity Coupled Networks , 2012, IEEE Transactions on Power Systems.

[6]  Andrzej J. Osiadacz Osiadacz,et al.  Simulation and Analysis of Gas Networks , 1987 .

[7]  C. H. Tiley,et al.  Unsteady and transient flow of compressible fluids in pipelines—a review of theoretical and some experimental studies , 1987 .

[8]  Michael Chertkov,et al.  Monotonicity of dissipative flow networks renders robust maximum profit problem tractable: General analysis and application to natural gas flows , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[9]  Aleksandr Rudkevich,et al.  Adaptive convex relaxations for Gas Pipeline Network Optimization , 2017, 2017 American Control Conference (ACC).

[10]  Vassilis Kekatos,et al.  Optimal Scheduling of Water Distribution Systems , 2018, IEEE Transactions on Control of Network Systems.

[11]  Claudio R. Fuerte-Esquivel,et al.  Integrated energy flow analysis in natural gas and electricity coupled systems , 2011, 2011 North American Power Symposium.

[12]  Y. Smeers,et al.  The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm , 2000 .

[13]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[14]  Dan Wang,et al.  Steady state and transient simulation for electricity-gas integrated energy systems by using convex optimisation , 2018 .

[15]  Michael Chertkov,et al.  Natural Gas Flow Solutions with Guarantees: A Monotone Operator Theory Approach , 2015, ArXiv.