Convexity and Starshapedness of feasible sets in Stationary Flow Networks

By Martin Gugat, Michael Schuster

This research was funded by DFG in the SFB Transregio 154: Mathematical modelling, simulation and optimization using the example of gas networks.


Uncertainty often plays an important role in application driven modeling. This often leads to optimization problems with probabilistic constraint. The main task insolving probabilistic constraint optimization problems is to compute the probabilistic constraint. The probabilistic constraint often has the form

\mathbb{P}(\ \zeta \in M\ ),

where \zeta is a realization of some random variable and M is the feasible set. The feasible set in our context are all stationary states in a gas network, for which the gas pressure satisfies box constraints at the network junctions. For computing this probability, we use the spheric radial decomposition (SRD) for Gaussian distributed random variables with zero mean and correlation R:

\mathbb{P}(\ \zeta \in M(x)\ ) = \int_{\mathbb{S}^{n-1}} \mu_\chi \{\ r \geq 0\ \vert\ r L v \in M\ \}\ d\mu_\eta(v).

Here, \mathbb{S}^{n-1} is the (n-1)-dimensional unit sphere in \mathbb{R}^n, \mu_\eta is the uniform distribution, \mu_\chi denotes the \chi-distribution with p degrees of freedom and L is such that R = L L^\top.

The one-dimensional sets \{\ r \geq 0\ \vert\ r L v \in M\ \} can be represented as union of disjoint intervals. For an algorithmic solution of the probabilistic constraint, a lot of knowledge of the feasible set M is necessary.

In [1], we analyze the feasible set for convexity and star-shapedness since then the one-dimensional sets \{\ r \geq 0\ \vert\ r L v \in M\ \} are just intervals and can be computed much faster.

A main assumption for both, convexity and star-shapedness is, that all upper pressure bounds are larger or equal to all lower pressure bounds. In Figure 1, we show some results for a linear graph with two edges and in Figure 2, we show some results for a tree-structured graph with two edges.

Figure 1. Feasible sets for different pressure bounds on a linear graph

Figure 2. Feasible sets for different pressure bounds on a tree-structured graph


[1] M. Gugat, R. Schultz, M. Schuster, Convexity and Starshapedness of Feasible Sets in Stationary Flow Networks, Netw. Heterog. Media, 15(2), 171-195, 2020


Don't miss out our posts on Math & Research!

Transition Layers in Elliptic Equations By Maicon Sônego   Stable transition layers in an unbalanced bistable equation Consider the following semi-linear problem where are positive functions in ; is a positive parameter and We assume that the functions satisfy ; for all ; there is a […]
Randomized time-splitting in linear-quadratic optimal control By Daniël Veldman   Introduction Solving an optimal control problem for a large-scale dynamical system can be computationally demanding. This problem appears in numerous applications. One example is Model Predictive Control (MPC), which requires the solution of several optimal control […]
Felix Klein: A Legacy of Innovation in Mathematics and Education By Roberto Rodríguez del Río, Complutense University of Madrid | IES San Mateo, Madrid   Felix Christian Klein lived in a period of history of science in which Mathematics were involved in a process of transformation, […]
Our last Publications
[cris show="publications" persID="223281397,105092142,229344528,239343629,241149469,243434665,105514816,242263337,104776092,236754096,243266999,243266999" year="2020" type="beitrag_fachzeitschrift" sortby="updated" quotation="apa" items="5"]
© 2019-2021 Chair for Dynamics, Control and Numerics - Alexander von Humboldt Professorship at FAU Erlangen-Nürnberg, Germany | Imprint | Contact