Refine
Year of publication
Language
- English (24)
Keywords
- robust optimization (5)
- Adjustable Robustness (2)
- Branch-and-cut (2)
- Combinatorial optimization (2)
- Graph Partitioning (2)
- Mixed-Integer Nonlinear Programming (2)
- Multilevel Optimization (2)
- Robust Optimization (2)
- chance constrained programming (2)
- optimal power flow (2)
- AC Optimal Power Flow (1)
- Aggregation (1)
- Complete description (1)
- Continuous Optimization (1)
- Convex Envelope (1)
- Cut-set inequalities (1)
- Discrete Decisions (1)
- Dynamic Network Flows (1)
- Dynamic Robust Flow (1)
- Electricity Market Design} (1)
- Electricity Markets (1)
- Equilibrium Problems (1)
- Existence (1)
- Gas Network Optimization (1)
- Generalized Benders Decomposition (1)
- Investment Incentives (1)
- Linear Complementarity Problems (1)
- Mixed-Integer Nonlinear Optimization (1)
- Mixed-integer programming (1)
- Network design (1)
- Network flow problems (1)
- OR in energy (1)
- Piecewise Linear Relaxation (1)
- Piecewise linear functions (1)
- Polyhedral demand uncertainty (1)
- Price Zones (1)
- R-vine copula (1)
- Robust Optimization, Mixed-integer programming, Uncertainty sets, Robust feasibility (1)
- Robust network design (1)
- Second-Order Cone Programming (1)
- Separation under uncertainty (1)
- Simultaneous Convexification (1)
- Uncertain Travel Times (1)
- Uniqueness (1)
- chance constraints (1)
- conditional uncertainty set (1)
- decision trees (1)
- decision-dependent uncertainty (1)
- distributionally robust optimization (1)
- gas networks (1)
- gradient descent (1)
- learning over time (1)
- mixed-integer programming (1)
- optimal control (1)
- polynomial optimization (1)
- power networks (1)
- random forests (1)
- relaxations (1)
- spheric-radial decomposition (1)
- stationary gas transport (1)
In many real-world mixed-integer optimisation problems from engineering, the side
constraints can be subdivided into two categories: constraints which describe a certain logic to model a feasible allocation of resources (such as a maximal number of available assets, working time requirements, maintenance requirements, contractual obligations, etc.),
and constraints which model physical processes and the related quantities (such as current,
pressure, temperature, etc.). While the first type of constraints can often easily be stated in
terms of a mixed-integer program (MIP), the second part may involve the incorporation of
complex non-linearities, partial differential equations or even a black-box simulation of the
involved physical process. In this work, we propose the integration of a trained tree-based
classifier – a decision-tree or a random forest, into a mixed-integer optimization model as a
possible remedy. We assume that the classifier has been trained on data points produced
by a detailed simulation of a given complex process to represent the functional relationship
between the involved physical quantities. We then derive MIP-representable reformulations
of the trained classifier such that the resulting model can be solved using state-of-the-art
solvers. At the hand of several use cases in terms of possible optimisation goals, we show
the broad applicability of our framework that is easily extendable to other tasks beyond
engineering. In a detailed real-world computational study for the design of stable direct-
current power networks, we demonstrate that our approach yields high-quality solutions
in reasonable computation times.
This work studies robust gas network optimization under uncertainties in demand and in the physical parameters. The corresponding optimization problems are nonconvex in node pressures and flows along the pipes. They are thus very difficult to solve for realistic instance sizes. In recent approaches, an adaptive bundle method has been developed, where one solves the occurring adversarial problems via iteratively refined piecewise linear relaxations. These subproblems need to be solved always from scratch using mixed-integer linear programming (MIP). As alternative to the MIP solver, we employ here a nonsmooth optimization approach that allows a warm start strategy such that it can profit from the results obtained for coarser relaxations. We evaluate the approach for realistic gas network topologies and outline possibilities for future research.
Robust DC Optimal Power Flow with Modeling of Solar Power Supply Uncertainty via R-Vine Copulas
(2021)
We present a robust approximation of joint chance constrained DC Optimal Power Flow in combination with a model-based prediction of uncertain power supply via R-vine copulas.
It is applied to optimize the discrete curtailment of solar feed-in in an electrical distribution network and guarantees network stability under fluctuating feed-in.
This is modeled by a two-stage mixed-integer stochastic optimization problem proposed by Aigner et al. (European Journal of Operational Research, (2021)).
The solution approach is based on the approximation of chance constraints via robust constraints using suitable uncertainty sets.
The resulting robust optimization problem has a known equivalent tractable reformulation.
To compute uncertainty sets that lead to an inner approximation of the stochastic problem, an R-vine copula model is fitted to the distribution of the multi-dimensional power forecast error, i.e., the difference between the forecasted solar power and the measured feed-in at several network nodes.
The uncertainty sets are determined by encompassing a sufficient number of samples drawn from the R-vine copula model.
Furthermore, an enhanced algorithm is proposed to fit R-vine copulas which can be used to draw conditional samples for given solar radiation forecasts.
The experimental results obtained for real-world weather and network data demonstrate the effectiveness of the combination of stochastic programming and model-based prediction of uncertainty via copulas.
We improve the outcomes of previous work by showing that the resulting uncertainty sets are much smaller and lead to less conservative solutions while maintaining the same probabilistic guarantees.
Mathematical modeling of market design issues in liberalized electricity markets often leads to mixed-integer nonlinear multilevel optimization problems for which no general-purpose solvers exist and which are intractable in general. In this work, we consider the problem of splitting a market area into a given number of price zones such that the resulting market design yields welfare-optimal outcomes. This problem leads to a challenging multilevel model that contains a graph-partitioning problem with multi-commodity flow connectivity constraints and nonlinearities due to proper economic modeling. Furthermore, it has highly symmetric solutions. We develop different problem-tailored solution approaches. In particular, we present an extended KKT transformation approach as well as a generalized Benders approach that both yield globally optimal solutions. These methods, enhanced with techniques such as symmetry breaking and primal heuristics, are evaluated in detail on academic as well as on realistic instances. It turns out that our approaches lead to effective solution methods for the difficult optimization tasks presented here, where the problem-specific generalized Benders approach performs considerably better than the methods based on KKT transformation.
In this paper we study feasibility and infeasibility of nonlinear two-stage
fully adjustable robust feasibility problems with an empty first stage. This
is equivalent to deciding set containment of a projection of the feasible
region and the uncertainty set. For answering this question, two very general
approaches using methods from polynomial optimization are presented --- one
for showing feasibility and one for showing infeasibility. The developed
methods are approximated through sum of squares polynomials and solved using
semidefinite programs.
Deciding robust feasibility and infeasibility is important for gas network
operations, which is a \nonconvex quadratic problem with absolute values
functions. Concerning the gas network problem, different topologies are
considered. It is shown that a tree structured network can be decided exactly
using linear programming. Furthermore, a method is presented to reduce a tree
network with one additional arc to a single cycle network. In this case,
removing the absolute values and solving the problem can be decided with
linearly many polynomial optimization problems.
Lastly, the effectivity of the methods is tested on a variety of small cyclic
networks. For instances where robust feasibility or infeasibility can be
decided, level~2 or level~3 of the Lasserre relaxation hierarchy is typically
sufficient.
In the course of the energy transition, load and supply centers are growing apart in electricity markets worldwide, rendering regional price signals even more important to provide adequate locational investment incentives. This paper focuses on electricity markets that operate under a zonal pricing market design. For a fixed number of zones, we endogenously derive the optimal configuration of price zones and available transfer capacities on a network in order to optimally govern investment and production decisions in the long run. In a multilevel mixed-integer nonlinear model that contains a graph partitioning problem on the first level, we determine welfare-maximizing price zones and available transfer capacities for a given electricity market and analyze their impact on market outcomes. Using a generalized Benders decomposition approach developed in Grimm et al. (2019) and a problem-tailored scenario clustering for reducing the input data size, we are able to solve the model to global optimality even for large instances. We apply the approach to the German electricity market as an example to examine the impact of optimal zoning on key performance indicators such as welfare, generation mix and locations, or electricity prices. It turns out that even for a small number of price zones, an optimal configuration of zones induces a welfare level that almost approaches the first best.
Solving mixed-integer nonlinear optimization problems (MINLPs) to global optimality is extremely challenging. An important step for enabling their solution consists in the design of convex relaxations of the feasible set. Known solution approaches based on spatial branch-and-bound become more effective the tighter the used relaxations are. Relaxations are commonly established by convex underestimators, where each constraint function is considered separately. Instead, a considerably tighter relaxation can be found via so-called simultaneous convexification, where convex underestimators are derived for more than one constraint function at a time. In this work, we present a global solution approach for solving mixed-integer nonlinear problems that uses simultaneous convexification. We introduce a separation method that relies on determining the convex envelope of linear combinations of the constraint functions and on solving a nonsmooth convex problem. In particular, we apply the method to quadratic absolute value functions and derive their convex envelopes. The practicality of the proposed solution approach is demonstrated on several test instances from gas network optimization, where the method outperforms standard approaches that use separate convex relaxations.
Currently, there are few theoretical or practical approaches available for general nonlinear robust optimization. Moreover, the approaches that do exist impose restrictive assumptions on the problem structure. We present an adaptive bundle method for nonlinear and non-convex robust optimization problems with a suitable notion of inexactness in function values and subgradients. As the worst case evaluation requires a global solution to the adversarial problem, it is a main challenge in a general non-convex nonlinear setting. Moreover, computing elements of an epsilon-perturbation of the Clarke subdifferential in the l2-norm sense is in general prohibitive for this class of problems. In this article, instead of developing an entirely new bundle concept, we demonstrate how existing approaches, such as Noll's bundle method for non-convex minimization with inexact information (Computational and analytical mathematics 50: 555-592, 2013) can be modified to be able to cope with this situation. Extending the non-convex bundle concept to the case of robust optimization in this way, we prove convergence under two assumptions: Firstly, that the objective function is lower C1 and secondly, that approximately optimal solutions to the adversarial maximization problem are available. The proposed method is hence applicable to a rather general setting of nonlinear robust optimization problems. In particular, we do not rely on a specific structure of the adversary's constraints. The considered class of robust optimization problems covers the case that the worst-case adversary only needs to be evaluated up to a certain precision. One possibility to evaluate the worst case with the desired degree of precision is the use of techniques from mixed-integer linear programming (MIP).
We investigate the procedure on some analytic examples. As applications, we study the gas transport problem under uncertainties in demand and in physical parameters that affect pressure losses in the pipes. Computational results for examples in large realistic gas network instances demonstrate the applicability as well as the efficiency of the method.
We propose a mathematical optimization model and its solution for joint chance constrained DC Optimal Power Flow. In this application, it is particularly important that there is a high probability of transmission limits being satisfied, even in the case of uncertain or fluctuating feed-in from renewable energy sources. In critical network situations where the network risks overload, renewable energy feed-in has to be curtailed by the transmission system operator (TSO). The TSO can reduce the feed-in in discrete steps at each network node. The proposed optimization model minimizes curtailment while ensuring that there is a high probability of transmission limits being maintained. The latter is modeled via (joint) chance constraints that are computationally challenging. Thus, we propose a solution approach based on the robust safe approximation of these constraints. Hereby, probabilistic constraints are replaced by robust constraints with suitably defined uncertainty sets constructed from historical data. The uncertainty sets are calculated by encompassing randomly drawn scenarios using the scenario approach proposed by Margellos et al. (IEEE Transactions on Automatic Control, 59 (2014)). The ability to discretely control the power feed-in then leads to a robust optimization problem with decision-dependent uncertainties, i.e. the uncertainty sets depend on decision variables. We propose an equivalent mixed-integer linear reformulation for box uncertainties with the exact linearization of bilinear terms. Finally, we present numerical results for different test cases from the Nesta archive, as well as for a real network. We consider the discrete curtailment of solar feed-in, for which we use real-world weather and network data. The experimental tests demonstrate the effectiveness of this method and run times are very fast. Moreover, on average the calculated robust solutions lead only to a small increase in curtailment, when compared to nominal solutions.
Joint model of probabilistic/robust (probust) constraints applied to gas network optimization
(2017)
Optimization tasks under uncertain conditions abound in many
real-life applications. Whereas 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 used in case
solutions are sought that are feasible for all realizations of uncertainties within
some pre-defined uncertainty set. As many applications contain different types
of uncertainties that require robust as well as probabilistic treatments, we deal with a class of joint probabilistic/robust constraints as its appears in
optimization problems under uncertainty. 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 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.