On probabilistic capacity maximization in a stationary gas network

ABSTRACT

The question for the capacity of a given gas network appears as an essential question that network operators and political administrations are regularly faced with. In that context, we present a novel mathematical approach in order to assist gas network operators in managing increasing uncertainty with respect to customers gas nominations and in exposing free network capacities while reliability of transmission and supply is taken into account. The approach is based on the rigorous examination of optimization problems with nonlinear probabilistic constraints. As consequence we deal with solving a problem belonging to the class of probabilistic/robust optimization problems, which can be formulated with some joint probabilistic constraint over an infinite system of random inequalities. We will show that the inequality system can be reduced to a finite one in the situation of considering a tree network topology. A detailed study of the problem of maximizing bookable capacities in a stationary gas network is presented. The focus will be on both the theoretical and numerical side. The analytical part consists in introducing and validating a generalized version of the known rank two constraint qualification. The results are important in order to solve the capacity problem numerically.

Keywords:

• Stationary gas networks
• booked capacities
• probabilistic constraints
• constraint qualification
• spheric-radial decomposition

Mathematics Subject Classification (2010):

• 90B15
• 90C15

Disclosure statement

No potential conflict of interest was reported by the author.

Additional information

Funding

The author thanks the Deutsche Forschungsgemeinschaft for their support within subproject B04 in CRC TRR 154 and the two anonymous referees for their very helpful critical comments.