Convexity and starshapedness of feasible sets in stationary flow networks

Abstract

In this paper, we consider a stationary model for the flow through a network. The flow is determined by the values at the boundary nodes of the network. We call these values the loads of the network. In the applications, the feasible loads must satisfy some box constraints. We analyze the structure of the set of feasible loads. Our analysis is motivated by gas pipeline flows, where the box constraints are pressure bounds. We present sufficient conditions that imply that the feasible set is star-shaped with respect to special points. Under stronger conditions, we prove the convexity of the set of feasible loads. All the results are given for passive networks with and without compressor stations. This analysis is motivated by the aim to use the spheric-radial decomposition for stochastic boundary data in this model. This paper can be used for simplifying the algorithmic use of the spheric-radial decomposition.