Filters

2018 - 20193

More filters

2019 - 201922020 - 20221
Reset filters

Settings

Author: Heitsch, Holger × Subject: probabilistic constraints ×

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Optimal Neumann boundary control of a vibrating string with uncertain initial data and probabilistic terminal constraints
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Farshbaf Shaker, Mohammad Hassan; Gugat, Martin; Heitsch, Holger; Henrion, René
    In optimal control problems, often initial data are required that are not known exactly in practice. In order to take into account this uncertainty, we consider optimal control problems for a system with an uncertain initial state. A finite terminal time is given. On account of the uncertainty of the initial state, it is not possible to prescribe an exact terminal state. Instead, we are looking for controls that steer the system into a given neighborhood of the desired terminal state with sufficiently high probability. This neighborhood is described in terms of an inequality for the terminal energy. The probabilistic constraint in the considered optimal control problem leads to optimal controls that are robust against the inevitable uncertainties of the initial state. We show the existence of such optimal controls. Numerical examples with optimal Neumann control of the wave equation are presented.
  • Thumbnail Image
    Item
    Joint model of probabilistic-robust (probust) constraints with application to gas network optimization
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2018) Adelhütte, Dennis; Aßmann, Denis; Grandón, Tatiana González; Gugat, Martin; Heitsch, Holger; Henrion, René; Liers, Frauke; Nitsche, Sabrina; Schultz, Rüdiger; Stingl, Michael; Wintergerst, David
    Optimization problems under uncertain conditions abound in many real-life applications. While solution approaches for probabilistic constraints are often developed in case the uncertainties can be assumed to follow a certain probability distribution, robust approaches are usually applied in case solutions are sought that are feasible for all realizations of uncertainties within some predefined uncertainty set. As many applications contain different types of uncertainties that require robust as well as probabilistic treatments, we introduce a class of joint probabilistic/robust constraints. Focusing on complex uncertain gas network optimization problems, we show the relevance of this class of problems for the task of maximizing free booked capacities in an algebraic model for a stationary gas network. We furthermore present approaches for finding their solution. Finally, we study the problem of controlling a transient system that is governed by the wave equation. The task consists in determining controls such that a certain robustness measure remains below some given upper bound with high probability.
  • Thumbnail Image
    Item
    On probabilistic capacity maximization in a stationary gas network
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2018) Heitsch, Holger
    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.