A continuous mapping theorem for the argmin-set functional with applications to convex stochastic processes

summary:For lower-semicontinuous and convex stochastic processes $Z_n$ and nonnegative random variables $\epsilon_n$ we investigate the pertaining random sets $A(Z_n,\epsilon_n)$ of all $\epsilon_n$-approximating minimizers of $Z_n$. It is shown that, if the finite dimensional distributions of the $Z_n$ converge to some $Z$ and if the $\epsilon_n$ converge in probability to some constant $c$, then the $A(Z_n,\epsilon_n)$ converge in distribution to $A(Z,c)$ in the hyperspace of Vietoris. As a simple corollary we obtain an extension of several argmin-theorems in the literature. In particular, in contrast to these argmin-theorems we do not require that the limit process has a unique minimizing point. In the non-unique case the limit-distribution is replaced by a Choquet-capacity

Computational and Near-Optimal Trade-Offs in Renewable Electricity System Modelling

In the decades to come, the European electricity system must undergo an unprecedented transformation to avert the devastating impacts of climate change. To devise various possibilities for achieving a sustainable yet cost-efficient system, in the thesis at hand, we solve large optimisation problems that coordinate the siting of generation, storage and transmission capacities. Thereby, it is critical to capture the weather-dependent variability of wind and solar power as well as transmission bottlenecks. In addition to modelling at high spatial and temporal resolution, this requires a detailed representation of the electricity grid. However, since the resulting computational challenges limit what can be investigated, compromises on model accuracy must be made, and methods from informatics become increasingly relevant to formulate models efficiently and to compute many scenarios. The first part of the thesis is concerned with justifying such trade-offs between model detail and solving times. The main research question is how to circumvent some of the challenging non-convexities introduced by transmission network representations in joint capacity expansion models while still capturing the core grid physics. We first examine tractable linear approximations of power flow and transmission losses. Subsequently, we develop an efficient reformulation of the discrete transmission expansion planning (TEP) problem based on a cycle decomposition of the network graph, which conveniently also accommodates grid synchronisation options. Because discrete investment decisions aggravate the problem\u27s complexity, we also cover simplifying heuristics that make use of sequential linear programming (SLP) and retrospective discretisation techniques. In the second half, we investigate other trade-offs, namely between least-cost and near-optimal solutions. We systematically explore broad ranges of technologically diverse system configurations that are viable without compromising the system\u27s overall cost-effectiveness. For example, we present solutions that avoid installing onshore wind turbines, bypass new overhead transmission lines, or feature a more regionally balanced distribution of generation capacities. Such alternative designs may be more widely socially accepted, and, thus, knowing about these degrees of freedom is highly policy-relevant. The method we employ to span the space of near-optimal solutions is related to modelling-to-generate-alternatives, a variant of multi-objective optimisation. The robustness of our results is further strengthened by considering technology cost uncertainties. To efficiently sweep the cost parameter space, we leverage multi-fidelity surrogate modelling techniques using sparse polynomial chaos expansion in combination with low-discrepancy sampling and extensive parallelisation on high-performance computing infrastructure