51 research outputs found
Recommended from our members
On probabilistic capacity maximization in a stationary gas network
The question for the capacity of a given gas network, i.e., determining
the maximal amount of gas that can be transported by a given network, appears
as an essential question that network operators and political administrations
are regularly faced with. In that context we present a novel the demand and
in exposing free network capacities while increasing reliability of
transmission and supply. The approach is based on the rigorous examination of
optimization problems with nonlinear probabilistic constraints. As
consequence we deal with solving an optimization problem with joint
probabilistic constraints 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 free booked capacities in a stationary gas network is
presented that comes up with an algebraic model involving Kirchhoffs first
and second laws. The focus will be on both the theoretical and numerical
side. We are going to validate a kind of rank two constraint qualification
implying the differentiability of the considered capacity problem. At the
numerical side we are going to solve the problem using a projected gradient
decent method, where the function and gradient evaluations of the
probabilistic constraints are performed by the approach of spheric-radial
decomposition applied for multivariate Gaussian random variables and more
general distributions
On probabilistic capacity maximization in a stationary gas network
The question for the capacity of a given gas network, i.e., determining the maximal amount of gas that can be transported by a given 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 to assist gas network operators in managing uncertainty with respect to the demand and in exposing free network capacities while increasing reliability of transmission and supply. The approach is based on the rigorous examination of optimization problems with nonlinear probabilistic constraints. As consequence we deal with solving an optimization problem with joint probabilistic constraints 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 free booked capacities in a stationary gas network is presented that comes up with an algebraic model involving Kirchhoff's first and second laws. The focus will be on both the theoretical and numerical side. We are going to validate a kind of rank two constraint qualification implying the differentiability of the considered capacity problem. At the numerical side we are going to solve the problem using a projected gradient decent method, where the function and gradient evaluations of the probabilistic constraints are performed by the approach of spheric-radial decomposition applied for multivariate Gaussian random variables and more general distributions
Consequences of uncertain friction for the transport of natural gas through passive networks of pipelines
Assuming a pipe-wise constant structure of the friction coefficient in the modeling of natural gas transport through a passive network of pipes via semilinear systems of balance laws with associated linear coupling and boundary conditions, uncertainty in this parameter is quantified by a Markov chain Monte Carlo method. Here, information on the prior distribution is obtained from practitioners. The results are applied to the problem of validating technical feasibility under random exit demand in gas transport networks. In particular, the impact of quantified uncertainty to the probability level of technical feasible exit demand situations is studied by two example networks of small and medium size. The gas transport of the network is modeled by stationary solutions that are steady states of the time dependent semilinear problems
An enumerative formula for the spherical cap discrepancy
The spherical cap discrepancy is a widely used measure for how uniformly a sample of points on the sphere is distributed. Being hard to compute, this discrepancy measure is typically replaced by some lower or upper estimates when designing optimal sampling schemes for the uniform distribution on the sphere. In this paper, we provide a fully explicit, easy to implement enumerative formula for the spherical cap discrepancy. Not surprisingly, this formula is of combinatorial nature and, thus, its application is limited to spheres of small dimension and moderate sample sizes. Nonetheless, it may serve as a useful calibrating tool for testing the efficiency of sampling schemes and its explicit character might be useful also to establish necessary optimality conditions when minimizing the discrepancy with respect to a sample of given size
Recommended from our members
Consequences of uncertain friction for the transport of natural gas through passive networks of pipelines
Assuming a pipe-wise constant structure of the friction coefficient in
the modeling of natural gas transport through a passive network of pipes via
semilinear systems of balance laws with associated linear coupling and
boundary conditions, uncertainty in this parameter is quantified by a Markov
chain Monte Carlo method. Here, information on the prior distribution is
obtained from practitioners. The results are applied to the problem of
validating technical feasibility under random exit demand in gas transport
networks. In particular, the impact of quantified uncertainty to the
probability level of technical feasible exit demand situations is studied by
two example networks of small and medium size. The gas transport of the
network is modeled by stationary solutions that are steady states of the time
dependent semilinear problems
Recommended from our members
On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints
We present an adaptive grid refinement algorithm to solve probabilistic optimization problems with infinitely many random constraints. Using a bilevel approach, we iteratively aggregate inequalities that provide most information not in a geometric but in a probabilistic sense. This conceptual idea, for which a convergence proof is provided, is then adapted to an implementable algorithm. The efficiency of our approach when compared to naive methods based on uniform grid refinement is illustrated for a numerical test example as well as for a water reservoir problem with joint probabilistic filling level constraints
A turnpike property for optimal control problems with dynamic probabilistic constraints
In this paper we consider systems that are governed by linear time-discrete dynamics with an initial condition, additive random perturbations in each step and a terminal condition for the expected values. We study optimal control problems where the objective function consists of a term of tracking type for the expected values and a control cost. In addition, the feasible states have to satisfy a conservative probabilistic constraint that requires that the probability that the trajectories remain in a given set F is greater than or equal to a given lower bound. An application are optimal control problems related to storage management systems with uncertain in- and output. We give sufficient conditions that imply that the optimal expected trajectories remain close to a certain state that can be characterized as the solution of an optimal control problem without prescribed initial- and terminal condition. In this way we contribute to the study of the turnpike phenomenon that is well-known in mathematical economics and make a step towards the extension of the turnpike theory to problems with probabilistic constraints
Are quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?
Quasi-Monte Carlo algorithms are studied for designing discrete approximations of two-stage linear stochastic programs with random right-hand side and continuous probability distribution. The latter should allow for a transformation to a distribution with independent marginals. The two-stage integrands are piecewise linear, but neither smooth nor lie in the function spaces considered for QMC error analysis. We show that under some weak geometric condition on the two-stage model all terms of their ANOVA decomposition, except the one of highest order, are continuously differentiable and that first and second order ANOVA terms have mixed first order partial derivatives. Hence, randomly shifted lattice rules (SLR) may achieve the optimal rate of convergence not depending on the dimension if the effective superposition dimension is at most two. We discuss effective dimensions and dimension reduction for two-stage integrands. The geometric condition is shown to be satisfied almost everywhere if the underlying probability distribution is normal and principal component analysis (PCA) is used for transforming the covariance matrix. Numerical experiments for a large scale two-stage stochastic production planning model with normal demand show that indeed convergence rates close to the optimal are achieved when using SLR and randomly scrambled Sobol' point sets accompanied with PCA for dimension reduction
Recommended from our members
A joint model of probabilistic/robust constraints for gas transport management in stationary networks
We present a novel mathematical algorithm to assist gas network
operators in managing uncertainty, while increasing reliability of
transmission and supply. As a result, we solve an optimization problem with a
joint probabilistic constraint over an infinite system of random
inequalities. Such models arise in the presence of uncertain parameters
having partially stochastic and partially nonstochastic character. The
application that drives this new approach is a stationary network with
uncertain demand (which are stochastic due to the possibility of fitting
statistical distributions based on historical measurements) and with
uncertain roughness coefficients in the pipes (which are uncertain but
non-stochastic due to a lack of attainable measurements). We study the
sensitivity of local uncertainties in the roughness coefficients and their
impact on a highly reliable network operation. In particular, we are going to
answer the question, what is the maximum uncertainty that is allowed (shaping
a maximal uncertainty set) around nominal roughness coefficients, such that
random demands in a stationary gas network can be satisfied at given high
probability level for no matter which realization of true roughness
coefficients within the uncertainty set. One ends up with a constraint, which
is probabilistic with respect to the load of gas and robust with respect to
the roughness coefficients. We demonstrate how such constraints can be dealt
with in the framework of the so-called spheric-radial decomposition of
multivariate Gaussian distributions. The numerical solution of a
corresponding optimization problem is illustrated. The results might assist
the network operator with the implementation of cost-intensive roughness
measurements
A joint model of probabilistic/robust constraints for gas transport management in stationary networks
We present a novel mathematical algorithm to assist gas network operators in managing uncertainty, while increasing reliability of transmission and supply. As a result, we solve an optimization problem with a joint probabilistic constraint over an infinite system of random inequalities. Such models arise in the presence of uncertain parameters having partially stochastic and partially non-stochastic character. The application that drives this new approach is a stationary network with uncertain demand (which are stochastic due to the possibility of fitting statistical distributions based on historical measurements) and with uncertain roughness coefficients in the pipes (which are uncertain but non-stochastic due to a lack of attainable measurements). We study the sensitivity of local uncertainties in the roughness coefficients and their impact on a highly reliable network operation. In particular, we are going to answer the question, what is the maximum uncertainty that is allowed (shaping a 'maximal' uncertainty set) around nominal roughness coefficients, such that random demands in a stationary gas network can be satisfied at given high probability level for no matter which realization of true roughness coefficients within the uncertainty set. One ends up with a constraint, which is probabilistic with respect to the load of gas and robust with respect to the roughness coefficients. We demonstrate how such constraints can be dealt with in the framework of the so-called spheric-radial decomposition of multivariate Gaussian distributions. The numerical solution of a corresponding optimization problem is illustrated. The results might assist the network operator with the implementation of cost-intensive roughness measurements
- …