TY - THES A1 - Manns, Julian T1 - Presolve of Linear Bilevel Programs N2 - Bilevel programs are complex optimization problems that can be used to model hierarchical decision processes, which occur e.g. in energy markets, critical infrastructure defense or pricing models. Even the most simple bilevel programs, where only linear objective functions and constraints appear, are non-convex optimization problems and equivalent single level formulations replace the lower level problem by its non-convex optimality constraints. This makes linear bilevel programs inherently difficult so solve. The simplification of mixed-integer linear programs before solving them, called presolve, significantly accelerated the solving of these problems. However, there is only very few literature on the topic of presolve of bilevel programs. In this thesis we review said literature on presolve of bilevel programs in the context of linear bilevel programming, derive new theoretical foundations for presolve of linear bilevel programs and then apply these results to analyze how common presolve techniques for linear and mixed integer programs can be used to presolve linear bilevel programs. Y1 - 2020 ER - TY - THES A1 - Philippi, Nora T1 - Analysis and Numerical Approximation of Transport Equations on Networks N2 - This work deals with the analysis and numerical approximation of transport problems on networks. Appropriate coupling conditions are proposed that allow to establish well-posedness of the continuous problem by semigroup theory. A discontinuous Galerkin method is proposed for the space discretization and its well-posedness and order optimal convergence rates are proven. In addition, the time discretization by the implicit Euler method is investigated. Y1 - 2020 ER -