TY - JOUR A1 - Gugat, Martin T1 - Synchronization of velocities in pipeline flow of blended gas JF - Journal of Mathematical Analysis and Applications N2 - We consider the pipeline flflow of blended gas. The flow is governed by a coupled system where for each component we have the isothermal Euler equations with an additional velocity coupling term that couples the velocities of the different components. Our motivation is hydrogen blending in natural gas pipelines, which will play a role in the transition to renewable energies. We show that with suitable boundary conditions the velocities of the gas components synchronize exponentially fast, as long as the L2-norm of the synchronization error is outside of a certain interval where the size of the interval is determined by the order of the interaction terms. This indicates that in some cases for a mixture of ncomponents it is justifified to use a flux model where it is assumed that all components flow with the same velocity. For the proofs we use an appropriately chosen Lyapunov function which is based upon the idea of relative energy. KW - Synchronization of solutions to PDEs KW - Quasi-linear hyperbolic PDE KW - Drift-flux model KW - Lyapunov function KW - Relative energy Y1 - 2026 U6 - https://doi.org/10.1016/j.jmaa.2025.130078 VL - 556 IS - 1 ER - TY - JOUR A1 - Giesselmann, Jan A1 - Karsai, Attila A1 - Tscherpel, Tabea T1 - Energy-consistent Petrov-Galerkin time discretization of port-Hamiltonian systems N2 - For a general class of nonlinear port-Hamiltonian systems we develop a high-order time discretization scheme with certain structure preservation properties. The finite or infinite-dimensional system under consideration possesses a Hamiltonian function, which represents an energy in the system and is conserved or dissipated along solutions. For infinite-dimensional systems this structure is preserved under suitable Galerkin discretization in space. The numerical scheme is energy-consistent in the sense that the Hamiltonian of the approximate solutions at time grid points behaves accordingly. This structure preservation property is achieved by specific design of a continuous Petrov-Galerkin (cPG) method in time. It coincides with standard cPG methods in special cases, in which the latter are energy-consistent. Examples of port-Hamiltonian ODEs and PDEs are presented to visualize the framework. In numerical experiments the energy consistency is verified and the convergence behavior is investigated. Y1 - 2025 U6 - https://doi.org/10.48550/arXiv.2404.12480 ER - TY - JOUR A1 - Breiten, Tobias A1 - Karsai, Attila T1 - Structure-preserving $H_\infty$ control for port-Hamiltonian systems N2 - We study $H_\infty$ control design for linear time-invariant port-Hamiltonian systems. By a modification of the two central algebraic Riccati equations, we ensure that the resulting controller will be port-Hamiltonian. Using these modified equations, we proceed to show that a corresponding balanced truncation approach preserves port-Hamiltonian structure. We illustrate the theoretical findings using numerical examples and observe that the chosen representation of the port-Hamiltonian system can have an influence on the approximation qualities of the reduced order model. Y1 - 2025 U6 - https://doi.org/10.1016/j.sysconle.2023.105493 ER - TY - JOUR A1 - Karsai, Attila T1 - Manifold turnpikes of nonlinear port-Hamiltonian descriptor systems under minimal energy supply N2 - Turnpike phenomena of nonlinear port-Hamiltonian descriptor systems under minimal energy supply are studied. Under assumptions on the smoothness of the system nonlinearities, it is shown that the optimal control problem is dissipative with respect to a manifold. Then, under controllability assumptions, it is shown that the optimal control problem exhibits a manifold turnpike property. Y1 - 2025 U6 - https://doi.org/10.1007/s00498-024-00384-7 ER - TY - JOUR A1 - Karsai, Attila A1 - Breiten, Tobias A1 - Ramme, Justus A1 - Schulze, Philipp T1 - Nonlinear port-Hamiltonian systems and their connection to passivity N2 - Port-Hamiltonian (pH) systems provide a powerful tool for modeling physical systems. Their energy-based perspective allows for the coupling of various subsystems through energy exchange. Another important class of systems, passive systems, are characterized by their inability to generate energy internally. In this paper, we explore first steps towards understanding the equivalence between passivity and the feasibility of port-Hamiltonian realizations in nonlinear systems. Based on our findings, we present a method to construct port-Hamiltonian representations of a passive system if the dynamics and the Hamiltonian are known. Y1 - 2025 U6 - https://doi.org/10.48550/arXiv.2409.06256 ER - TY - JOUR A1 - Breiten, Tobias A1 - Karsai, Attila T1 - Passive feedback control for nonlinear systems N2 - Dynamical systems can be used to model a broad class of physical processes, and conservation laws give rise to system properties like passivity or port-Hamiltonian structure. An important problem in practical applications is to steer dynamical systems to prescribed target states, and feedback controllers combining a regulator and an observer are a powerful tool to do so. However, controllers designed using classical methods do not necessarily obey energy principles, which makes it difficult to model the controller-plant interaction in a structured manner. In this paper, we show that a particular choice of the observer gain gives rise to passivity properties of the controller that are independent of the plant structure. Furthermore, we state conditions for the controller to have a port-Hamiltonian realization and show that a model order reduction scheme can be deduced using the framework of nonlinear balanced truncation. In addition, we propose a novel passivity preserving discrete gradient scheme for the time discretization of passive systems. To illustrate our results, we numerically realize the controller using the policy iteration and compare it to a controller where the observer gain is given by the extended Kalman filter. Y1 - 2025 U6 - https://doi.org/10.48550/arXiv.2502.04987 ER - TY - JOUR A1 - Egerer, Jonas A1 - Grimm, Veronika A1 - Niazmand, Kiana A1 - Runge, Philipp T1 - The economics of global green ammonia trade – "Shipping Australian wind and sunshine to Germany" JF - Applied Energy N2 - This paper contributes to understanding the transformation of global energy trade to green energy carriers, focusing on green ammonia as the foreseeable first green hydrogen carrier. We provide a comprehensive overview of today's ammonia trade and assess scaling options for the trade of green ammonia. To that aim, we develop an optimization model for the integrated assessment of the green ammonia value chain that covers all steps from green ammonia production in an exporting country, up to delivery to a harbor in an importing country. The model endogenously chooses among different technology options and determines cost minimal operation. In a case study, we apply the model to the large-scale import of ammonia from Australia to Germany in a scenario for 2030. The results show that green ammonia can reach cost parity with gray ammonia even for moderate gas prices (but not necessarily with blue ammonia) if CO2 prices are high enough. We also provide a sensitivity analysis with respect to the interest rate and other key technical and economic parameters and show that cracking ammonia to provide pure hydrogen comes at a 45 % cost markup per MWh at the destination. KW - green ammonia KW - ammonia trade KW - optimization model KW - case study Australia to Germany Y1 - 2023 U6 - https://doi.org/https://doi.org/10.1016/j.apenergy.2023.120662 VL - 334 ER - TY - INPR A1 - Sauter, Henning A1 - Tischendorf, Caren T1 - Least squares collocation for the simulation of gas network DAEs Y1 - 2021 ER - TY - INPR A1 - Sauter, Henning A1 - Tischendorf, Caren T1 - Optimal control of gas network DAEs Y1 - 2021 ER - TY - JOUR A1 - Klimm, Max A1 - Warode, Philipp T1 - Parametric computation of minimum cost flows with piecewise quadratic costs JF - Mathematics of Operations Research N2 - We develop algorithms solving parametric flow problems with separable, continuous, piecewise quadratic, and strictly convex cost functions. The parameter to be considered is a common multiplier on the demand of all nodes. Our algorithms compute a family of flows that are each feasible for the respective demand and minimize the costs among the feasible flows for that demand. For single commodity networks with homogenous cost functions, our algorithm requires one matrix multiplication for the initialization, a rank 1 update for each nondegenerate step and the solution of a convex quadratic program for each degenerate step. For nonhomogeneous cost functions, the initialization requires the solution of a convex quadratic program instead. For multi-commodity networks, both the initialization and every step of the algorithm require the solution of a convex program. As each step is mirrored by a breakpoint in the output this yields output-polynomial algorithms in every case. Y1 - 2021 U6 - https://doi.org/10.1287/moor.2021.1151 ER - TY - JOUR A1 - Gugat, Martin A1 - Rosier, Lionel A1 - Perrollaz, Vincent ED - Arendt, W. ED - Pierre, M. T1 - Boundary stabilization of quasilinear hyperbolic systems of balance laws: exponential decay for small source terms JF - Journal of Evolution Equations N2 - We investigate the long-time behaviour of solutions of quasilinear hyperbolic systems with transparent boundary conditions when small source terms are incorporated in the system. Even if the finite-time stability of the system is not preserved, it is shown here that an exponential convergence towards the steady state still holds with a decay rate which is proportional to the logarithm of the amplitude of the source term. The result is stated for a system with dynamical boundary conditions in order to deal with initial data that are free of any compatibility condition. The proof of the existence and uniqueness of a solution defined for all positive times is also provided in this paper. Y1 - 2018 U6 - https://doi.org/10.1007/s00028-018-0449-z ER - TY - JOUR A1 - Leugering, Günter A1 - Martin, Alexander A1 - Schmidt, Martin A1 - Sirvent, Mathias T1 - Nonoverlapping Domain Decomposition for Optimal Control Problems governed by Semilinear Models for Gas Flow in Networks N2 - We consider optimal control problems for gas flow in pipeline networks. The equations of motion are taken to be represented by a first-order system of hyperbolic semilinear equations derived from the fully nonlinear isothermal Euler gas equations. We formulate an optimal control problem on a network and introduce a tailored time discretization thereof. In order to further reduce the complexity, we consider an instantaneous control strategy. The main part of the paper is concerned with a nonoverlapping domain decomposition of the optimal control problem on the graph into local problems on smaller sub-graphs - ultimately on single edges. We prove convergence of the domain decomposition method on networks and study the wellposedness of the corresponding time-discrete optimal control problems. The point of the paper is that we establish virtual control problems on the decomposed subgraphs such that the corresponding optimality systems are in fact equal to the systems obtained via the domain decomposition of the entire optimality system. KW - Optimal control, Gas networks, Euler's equation, Semilinear PDE, Nonoverlapping domain decomposition Y1 - 2017 VL - 46 IS - 3 SP - 191 EP - 225 PB - Control and Cybernetics ER - TY - JOUR A1 - Gugat, Martin A1 - Herty, Michael A1 - Müller, Siegfried ED - Piccoli, Benedetto T1 - Coupling conditions for the transition from supersonic to subsonic fluid states JF - Networks and Heterogeneous Media (NHM) N2 - We discuss coupling conditions for the p-system in case of a transition from supersonic states to subsonic states. A single junction with adjacent pipes is considered where on each pipe the gas ow is governed by a general p-system. By extending the notion of demand and supply known from traffic fiow analysis we obtain a constructive existence result of solutions compatible with the introduced conditions. KW - p-system KW - coupling conditions KW - network Y1 - 2017 U6 - https://doi.org/10.3934/nhm.2017016 VL - 12 IS - 3 SP - 371 EP - 380 ER - TY - JOUR A1 - Gugat, Martin A1 - Leugering, Günter A1 - Wang, Ke ED - Zhang, Xu T1 - Neumann boundary feedback stabilization for a nonlinear wave equation: A strict H2-Lyapunov function JF - Mathematical Control and Related Fields (MCRF) N2 - For a system that is governed by the isothermal Euler equations with friction for ideal gas, the corresponding field of characteristic curves is determined by the velocity of the flow. This velocity is determined by a second-order quasilinear hyperbolic equation. For the corresponding initial-boundary value problem with Neumann-boundary feedback, we consider non-stationary solutions locally around a stationary state on a finite time interval and discuss the well-posedness of this kind of problem. We introduce a strict H2-Lyapunov function and show that the boundary feedback constant can be chosen such that the H2-Lyapunov function and hence also the H2-norm of the difference between the non-stationary and the stationary state decays exponentially with time. KW - Boundary feedback control, feedback stabilization, exponential stability, isothermal Euler equations, second-order quasilinear equation, Lyapunov function, stationary state, non-stationary state, gas pipeline. Y1 - 2017 U6 - https://doi.org/10.3934/mcrf.2017015 VL - 7 IS - 3 SP - 419 EP - 448 ER - TY - JOUR A1 - Gugat, Martin A1 - Ulbrich, Stefan ED - CHEN, GOONG T1 - The isothermal Euler equations for ideal gas with source term: Product solutions, flow reversal and no blow up JF - Journal of Mathematical Analysis and Applications KW - Global classical solutions Ideal gas Bi-directional flow Transsonic flow Y1 - 2017 U6 - https://doi.org/10.1016/j.jmaa.2017.04.064 VL - 454 IS - 1 SP - 439 EP - 452 ER - TY - JOUR A1 - Schmidt, Martin A1 - Aßmann, Denis A1 - Burlacu, Robert A1 - Humpola, Jesco A1 - Joormann, Imke A1 - Kanelakis, Nikolaos A1 - Koch, Thorsten A1 - Oucherif, Djamal A1 - Pfetsch, Marc E. A1 - Schewe, Lars A1 - Schwarz, Robert A1 - Sirvent, Mathias T1 - GasLib – A Library of Gas Network Instances JF - Data N2 - The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare these models and algorithms, gas network instances together with demand data are needed. The goal of GasLib is to provide a set of publicly available gas network instances that can be used by researchers in the field of gas transport. The advantages are that researchers save time by using these instances and that different models and algorithms can be compared on the same specified test sets. The library instances are encoded in an XML format. In this paper, we explain this format and present the instances that are available in the library. KW - Gas Transport KW - Networks KW - Problem Instances KW - Mixed-Integer Nonlinear Optimization KW - GasLib Y1 - 2017 U6 - https://doi.org/10.3390/data2040040 VL - 4 IS - 2 ER - TY - JOUR A1 - Gonzalez Grandon, Tatiana A1 - Heitsch, Holger A1 - Henrion, Rene T1 - A joint model of probabilistic/robust constraints for gas transport management in stationary networks JF - Computational Management Science N2 - 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. KW - chance constraint KW - robust constraint KW - uncertainty set KW - spheric-radial decomposition Y1 - 2017 U6 - https://doi.org/10.1007/s10287-017-0284-7 VL - 14 SP - 443 EP - 460 ER - TY - JOUR A1 - Gugat, Martin A1 - Leugering, Günter A1 - Martin, Alexander A1 - Schmidt, Martin A1 - Sirvent, Mathias A1 - Wintergerst, David T1 - MIP-Based Instantaneous Control of Mixed-Integer PDE-Constrained Gas Transport Problems JF - Computational Optimization and Applications N2 - We study the transient optimization of gas transport networks including both discrete controls due to switching of controllable elements and nonlinear fluid dynamics described by the system of isothermal Euler equations, which are partial differential equations in time and 1-dimensional space. This combination leads to mixed-integer optimization problems subject to nonlinear hyperbolic partial differential equations on a graph. We propose an instantaneous control approach in which suitable Euler discretizations yield systems of ordinary differential equations on a graph. This networked system of ordinary differential equations is shown to be well-posed and affine-linear solutions of these systems are derived analytically. As a consequence, finite-dimensional mixed-integer linear optimization problems are obtained for every time step that can be solved to global optimality using general-purpose solvers. We illustrate our approach in practice by presenting numerical results on a realistic gas transport network. KW - Mixed-integer optimal control KW - Instantaneous control KW - Partial differential equations on graphs KW - Gas networks KW - Mixed-integer linear optimization Y1 - 2017 U6 - https://doi.org/10.1007/s10589-017-9970-1 VL - 70 IS - 1 SP - 267 EP - 294 ER - TY - JOUR A1 - Gugat, Martin A1 - Hante, Falk T1 - Lipschitz Continuity of the Value Function in Mixed-Integer Optimal Control Problems JF - Mathematics of Control, Signals, and Systems Y1 - 2017 U6 - https://doi.org/10.1007/s00498-016-0183-4 VL - 29 IS - 1 ER - TY - JOUR A1 - Guigues, Vincent A1 - Henrion, Rene T1 - Joint dynamic probabilistic constraints with projected linear decision rules JF - Optimization Methods and Software N2 - We consider multistage stochastic linear optimization problems combining joint dynamic probabilistic constraints with hard constraints. We develop a method for projecting decision rules onto hard constraints of wait-and-see type. We establish the relation between the original (infinite dimensional) problem and approximating problems working with projections from different subclasses of decision policies. Considering the subclass of linear decision rules and a generalized linear model for the underlying stochastic process with noises that are Gaussian or truncated Gaussian, we show that the value and gradient of the objective and constraint functions of the approximating problems can be computed analytically. Y1 - 2016 U6 - https://doi.org/10.1080/10556788.2016.1233972 VL - 32 SP - 1006 EP - 1032 ER - TY - JOUR A1 - Diniz, Andre Luiz A1 - Henrion, Rene T1 - On probabilistic constraints with multivariate truncated Gaussian and lognormal distributions JF - Energy Systems N2 - Many engineering problems with uncertain data, notably arising in power management, can be formulated as optimization problems subject to probabilistic constraints. While dealing with such constraints under continuous distributions of the underlying random parameter remains a difficult task in general both from the numerical and theoretical point of view, quite some progress has been made in the special case of multivariate Gaussian distributions. These are not perfectly adequate, however, in many circumstances, in particular not, when modeling uncertain inflows to hydro reservoirs or uncertain demands in gas networks. Interesting alternatives are offered by truncations of multivariate Gaussian distributions to polyhedra or by multivariate lognormal distributions. The paper discusses the applicability of such distributions in the context of a simple joint linear probabilistic constraint putting the emphasis on the numerical approximation of probabilities and their gradients (w.r.t. decisions to be optimized) as well as on the convexity of the set of feasible decisions. Y1 - 2016 U6 - https://doi.org/10.1007/s12667-015-0180-6 VL - 8 SP - 149 EP - 167 ER - TY - JOUR A1 - van Ackooij, Wim A1 - Henrion, Rene T1 - (Sub-) Gradient formulae for probability functions of random inequality systems under Gaussian distribution JF - SIAM/ASA J. Uncertainty Quantification N2 - We consider probability functions of parameter-dependent random inequality systems under Gaussian distribution. As a main result, we provide an upper estimate for the Clarke subdifferential of such probability functions without imposing compactness conditions. A constraint qualification ensuring continuous differentiability is formulated. Explicit formulae are derived from the general result in case of linear random inequality systems. In the case of a constant coefficient matrix an upper estimate for even the smaller Mordukhovich subdifferential is proven. Y1 - 2017 U6 - https://doi.org/10.1137/16M1061308 VL - 5 SP - 63 EP - 87 ER - TY - JOUR A1 - Gugat, Martin A1 - Zuazua, Enrique ED - Grimble, Mike J. T1 - Exact penalization of terminal constraints for optimal control problems JF - OPTIMAL CONTROL APPLICATIONS AND METHODS N2 - We study optimal control problems for linear systems with prescribed initial and terminal states. We analyze the exact penalization of the terminal constraints. We show that for systems that are exactly controllable, the norm-minimal exact control can be computed as the solution of an optimization problem without terminal constraint but with a nonsmooth penalization of the end conditions in the objective function, if the penalty parameter is sufficiently large. We describe the application of the method for hyperbolic and parabolic systems of partial differential equations, considering the wave and heat equations as particular examples. Copyright © 2016 John Wiley & Sons, Ltd. Y1 - 2016 U6 - https://doi.org/10.1002/oca.2238 VL - 37 IS - 6 SP - 1329 EP - 1354 ER - TY - CHAP A1 - Hante, Falk T1 - On the relaxation gap for PDE mixed-integer optimal control problems T2 - Proceedings in Applied Mathematics and Mechanics Y1 - 2016 U6 - https://doi.org/10.1002/pamm.201610380 VL - 16 SP - 783 EP - 784 ER - TY - JOUR A1 - Gugat, Martin A1 - Trelat, Emmanuel A1 - Zuazua, Enrique ED - Sepulchre, Rodolphe T1 - Optimal Neumann control for the 1D wave equation: Finite horizon, infinite horizon, boundary tracking terms and the turnpike property JF - Systems & Control Letters N2 - We consider a vibrating string that is fixed at one end with Neumann control action at the other end. We investigate the optimal control problem of steering this system from given initial data to rest, in time TT, by minimizing an objective functional that is the convex sum of the L2L2-norm of the control and of a boundary Neumann tracking term. We provide an explicit solution of this optimal control problem, showing that if the weight of the tracking term is positive, then the optimal control action is concentrated at the beginning and at the end of the time interval, and in-between it decays exponentially. We show that the optimal control can actually be written in that case as the sum of an exponentially decaying term and of an exponentially increasing term. This implies that, if the time TT is large, then the optimal trajectory approximately consists of three arcs, where the first and the third short-time arcs are transient arcs, and in the middle arc the optimal control and the corresponding state are exponentially close to 00. This is an example of a turnpike phenomenon for a problem of optimal boundary control. If T=+∞T=+∞ (infinite time horizon problem), then only the exponentially decaying component of the control remains, and the norms of the optimal control action and of the optimal state decay exponentially in time. In contrast to this situation, if the weight of the tracking term is zero and only the control cost is minimized, then the optimal control is distributed uniformly along the whole interval [0,T][0,T] and coincides with the control given by the Hilbert Uniqueness Method. In addition, we establish a similarity theorem stating that, for every T>0T>0, there exists an appropriate weight λ<1λ<1 for which the optimal solutions of the corresponding finite horizon optimal control problem and of the infinite horizon optimal control problem coincide along the first part of the time interval [0,2][0,2]. We also discuss the turnpike phenomenon from the perspective of a general framework with a strongly continuous semi-group. KW - Neumann boundary control KW - Turnpike phenomenon KW - Exact control Y1 - 2016 U6 - https://doi.org/10.1016/j.sysconle.2016.02.001 VL - 90 SP - 61 EP - 70 ER - TY - JOUR A1 - Grimm, Veronika A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Zöttl, Gregor T1 - Uniqueness of Market Equilibrium on a Network: A Peak-Load Pricing Approach JF - European Journal of Operational Research N2 - In this paper we analyze peak-load pricing in the presence of network constraints. In our setup, firms facing fluctuating demand decide on the size and location of production facilities. They make production decisions constrained by the invested capacities, taking into account that market prices reflect scarce transmission capacities. We state general conditions for existence and uniqueness of the market equilibrium and provide a characterization of equilibrium investment and production. The presented analysis covers the cases of perfect competition and monopoly - the case of strategic firms is approximated by a conjectural variations approach. Our result is a prerequisite for analyzing regulatory policy options with computational multilevel equilibrium models, since uniqueness of the equilibrium at lower levels is of key importance when solving these models. Thus, our paper contributes to an evolving strand of literature that analyzes regulatory policy based on computational multilevel equilibrium models and aims at taking into account individual objectives of various agents, among them not only generators and customers but also, e.g., the regulator deciding on network expansion. KW - Pricing KW - Peak-Load Pricing KW - Networks KW - Uniqueness Y1 - 2017 U6 - https://doi.org/10.1016/j.ejor.2017.03.036 VL - 261 IS - 3 SP - 971 EP - 983 ER - TY - JOUR A1 - Grimm, Veronika A1 - Martin, Alexander A1 - Schmidt, Martin A1 - Weibelzahl, Martin A1 - Zöttl, Gregor T1 - Transmission and generation investment in electricity markets: The effects of market splitting and network fee regimes JF - European Journal of Operational Research N2 - We propose an equilibrium model that allows to analyze the long-run impact of the electricity market design on transmission line expansion by the regulator and investment in generation capacity by private firms in liberalized electricity markets. The model incorporates investment decisions of the transmission system operator and private firms in expectation of an energy-only market and cost-based redispatch. In different specifications we consider the cases of one vs. multiple price zones (market splitting) and analyze different approaches to recover network cost—in particular lump sum, generation capacity based, and energy based fees. In order to compare the outcomes of our multilevel market model with a first best benchmark, we also solve the corresponding integrated planner problem. Using two test networks we illustrate that energy-only markets can lead to suboptimal locational decisions for generation capacity and thus imply excessive network expansion. Market splitting heals these problems only partially. These results are valid for all considered types of network tariffs, although investment slightly differs across those regimes. KW - Electricity market modeling KW - Mixed-integer nonlinear optimization KW - Multilevel programming KW - Network expansion KW - Transmission management Y1 - 2016 U6 - https://doi.org/10.1016/j.ejor.2016.03.044 VL - 254 IS - 2 SP - 493 EP - 509 ER - TY - JOUR A1 - Geißler, Björn A1 - Morsi, Antonio A1 - Schewe, Lars A1 - Schmidt, Martin T1 - Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps JF - SIAM Journal on Optimization N2 - Feasibility pumps are highly effective primal heuristics for mixed-integer linear and nonlinear optimization. However, despite their success in practice there are only few works considering their theoretical properties. We show that feasibility pumps can be seen as alternating direction methods applied to special reformulations of the original problem, inheriting the convergence theory of these methods. Moreover, we propose a novel penalty framework that encompasses this alternating direction method, which allows us to refrain from random perturbations that are applied in standard versions of feasibility pumps in case of failure. We present a convergence theory for the new penalty based alternating direction method and compare the new variant of the feasibility pump with existing versions in an extensive numerical study for mixed-integer linear and nonlinear problems. Y1 - 2017 U6 - https://doi.org/10.1137/16M1069687 VL - 27 IS - 3 SP - 1611 EP - 1636 ER - TY - JOUR A1 - Hante, Falk A1 - Mommer, Mario A1 - Potschka, Andreas T1 - Newton-Picard preconditioners for time-periodic, parabolic optimal control problems JF - SIAM Journal on Numerical Analysis Y1 - 2016 U6 - https://doi.org/10.1137/140967969 VL - 53 IS - 5 SP - 2206 EP - 2225 ER - TY - JOUR A1 - Domschke, Pia A1 - Groß, Martin A1 - Hiller, Benjamin A1 - Hante, Falk A1 - Schewe, Lars A1 - Schmidt, Martin T1 - Mathematische Modellierung, Simulation und Optimierung von Gastransportnetzwerken JF - gwf-gas/erdgas Y1 - 2015 VL - 11 SP - 880 EP - 885 ER - TY - JOUR A1 - Liers, Frauke A1 - Merkert, Maximilian T1 - Structural Investigation of Piecewise Linearized Network Flow Problems N2 - In this work we study polyhedra in the context of network flow problems, where the flow value on each arc lies in one of several predefined intervals. This is motivated by nonlinear problems on transportation networks, where nonlinearities are handled by piecewise linear approximation or relaxation - a common and established approach in many applications. Several methods for modeling piecewise linear functions are known which provide a complete description for a single network arc. However, in general this property is lost when considering multiple arcs. We show how to strengthen the formulation for specific substructures consisting of multiple arcs by linear inequalities. For the case of paths of degree-two-nodes we give a complete description of the polyhedron projected to the integer variables. Our model is based on - but not limited to - the multiple choice method; we also show how to transfer our results to a formulation based on the incremental method. Computational results show that a state-of-the-art MIP-solver greatly benefits from using our cutting planes for random and realistic network topologies. KW - Combinatorial optimization KW - Complete description KW - Network flow problems KW - Piecewise linear functions Y1 - 2016 U6 - https://doi.org/10.1137/15M1006751 VL - 26 SP - 2863 EP - 2886 ER - TY - JOUR A1 - Bärmann, Andreas A1 - Liers, Frauke A1 - Martin, Alexander A1 - Merkert, Maximilian A1 - Thurner, Christoph A1 - Weninger, Dieter T1 - Solving network design problems via iterative aggregation JF - Mathematical Programming Computation N2 - In this work, we present an exact approach for solving network design problems that is based on an iterative graph aggregation procedure. The scheme allows existing preinstalled capacities. Starting with an initial aggregation, we solve a sequence of network design master problems over increasingly fine-grained representations of the original network. In each step, a subproblem is solved that either proves optimality of the solution or gives a directive where to refine the representation of the network in the subsequent iteration. The algorithm terminates with a globally optimal solution to the original problem. Our implementation uses a standard integer programming solver for solving the master problems as well as the subproblems. The computational results on random and realistic instances confirm the profitable use of the iterative aggregation technique. The computing time often reduces drastically when our method is compared to solving the original problem from scratch. KW - Aggregation KW - Network design KW - Combinatorial optimization KW - Mixed-integer programming KW - Branch-and-cut Y1 - 2015 U6 - https://doi.org/10.1007/s12532-015-0079-1 VL - 7 IS - 2 SP - 189 EP - 217 ER - TY - JOUR A1 - Gottschalk, Corinna A1 - Koster, Arie M.C.A. A1 - Liers, Frauke A1 - Peis, Britta A1 - Schmand, Daniel A1 - Wierz, Andreas T1 - Robust Flows over Time: Models and Complexity Results N2 - We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon T, while flow requires a certain travel time to traverse an arc. In our setting, we account for uncertain travel times of flow. We investigate maximum flows over time under the assumption that at most Γ travel times may be prolonged simultaneously due to delay. We develop and study a mathematical model for this problem. As the dynamic robust flow problem generalizes the static version, it is NP-hard to compute an optimal flow. However, our dynamic version is considerably more complex than the static version. We show that it is NP-hard to verify feasibility of a given candidate solution. Furthermore, we investigate temporally repeated flows and show that in contrast to the non-robust case (i.e., without uncertainties) they no longer provide optimal solutions for the robust problem, but rather yield a worst case optimality gap of at least T. We finally show that for infinite delays, the optimality gap is at most O(k log T), where k is a newly introduced instance characteristic. The results obtained in this paper yield a first step towards understanding robust dynamic flow problems with uncertain travel times. KW - Dynamic Network Flows KW - Uncertain Travel Times KW - Dynamic Robust Flow Y1 - 2017 U6 - https://doi.org/10.1007/s10107-017-1170-3 ER - TY - JOUR A1 - Cacchiani, Valentina A1 - Jünger, Michael A1 - Liers, Frauke A1 - Lodi, Andrea A1 - Schmidt, Daniel T1 - Single-commodity robust network design with finite and Hose demand sets JF - Mathematical Programming N2 - We study a single-commodity robust network design problem (sRND) defined on an undirected graph. Our goal is to determine minimum cost capacities such that any traffic demand from a given uncertainty set can be satisfied by a feasible single-commodity flow. We consider two ways of representing the uncertainty set, either as a finite list of scenarios or as a polytope. We propose a branch-and-cut algorithm to derive optimal solutions to sRND, built on a capacity-based integer linear programming formulation. It is strengthened with valid inequalities derived as {0, 1/2}-Chvátal–Gomory cuts. Since the formulation contains exponentially many constraints, we provide practical separation algorithms. Extensive computational experiments show that our approach is effective, in comparison to existing approaches from the literature as well as to solving a flow based formulation by a general purpose solver. KW - Robust network design KW - Branch-and-cut KW - Cut-set inequalities KW - Polyhedral demand uncertainty KW - Separation under uncertainty Y1 - 2016 U6 - https://doi.org/10.1007/s10107-016-0991-9 VL - 157 IS - 1 SP - 297 EP - 342 ER - TY - JOUR A1 - Pfaff, Sebastian A1 - Ulbrich, Stefan T1 - Optimal Control of Nonlinear Hyperbolic Conservation Laws by On/Off-Switching JF - Optimization Methods and Software N2 - This paper studies the differentiability properties of the control-to-state mapping for entropy solutions to a scalar hyperbolic conservation law on R with respect to the switching times of an on/off-control. The switching times between on-modes and off-modes are the control variables of the considered optimization problem, where a general tracking-type functional is minimized.We investigate the differentiability of the reduced objective function, also in the presence of shocks. We show that the state y(t,·) at some observation time t depends differentiably on the switching times in a generalized sense that implies total differentiability for the composition with a tracking functional. Furthermore, we present an adjoint-based formula for the gradient of the reduced objective functional with respect to the switching times. KW - optimal control, scalar conservation law, network Y1 - 2017 U6 - https://doi.org/10.1080/10556788.2016.1236796 VL - 32 SP - 904 EP - 939 ER - TY - JOUR A1 - Pfaff, Sebastian A1 - Ulbrich, Stefan T1 - Optimal Boundary Control of Nonlinear Hyperbolic Conservation Laws with Switched Boundary Data JF - SIAM Journal on Control and Optimization N2 - We consider the optimal control of initial-boundary value problems for entropy solutions of scalar hyperbolic conservation laws. In particular, we consider initial-boundary value problems where the initial and boundary data switch between different C¹-functions at certain switching points and both the functions and the switching points are controlled. We show that the control-to-state mapping is differentiable in a certain generalized sense, which implies Fréchet-differentiability with respect to the control functions and the switching points for the composition with a tracking type functional, even in the presence of shocks. We also present an adjoint-based formula for the gradient of the reduced objective functional. KW - optimal control, scalar conservation law, differentiability, adjoint state, shock sensitivity Y1 - 2016 U6 - https://doi.org/10.1137/140995799 VL - 53 IS - 3 SP - 1250 EP - 1277 ER - TY - JOUR A1 - Geißler, Björn A1 - Morsi, Antonio A1 - Schewe, Lars A1 - Schmidt, Martin T1 - Solving Power-Constrained Gas Transportation Problems using an MIP-based Alternating Direction Method JF - Computers & Chemical Engineering N2 - We present a solution algorithm for problems from steady-state gas transport optimization. Due to nonlinear and nonconvex physics and engineering models as well as discrete controllability of active network devices, these problems lead to difficult nonconvex mixed-integer nonlinear optimization models. The proposed method is based on mixed-integer linear techniques using piecewise linear relaxations of the nonlinearities and a tailored alternating direction method. Most other publications in the field of gas transport optimization only consider pressure and flow as main physical quantities. In this work, we additionally incorporate heat power supplies and demands as well as a mixing model for different gas qualities. We demonstrate the capabilities of our method on Germany's largest transport networks and hereby present numerical results on the largest instances that were ever reported in the literature for this problem class. Y1 - 2016 U6 - https://doi.org/10.1016/j.compchemeng.2015.07.005 VL - 82 IS - 2 SP - 303 EP - 317 ER - TY - JOUR A1 - Sirvent, Mathias A1 - Kanelakis, Nikolaos A1 - Geißler, Björn A1 - Biskas, Pandelis T1 - A Linearized Model for the Optimization of the Coupled Electricity and Natural Gas System JF - Journal of Modern Power Systems and Clean Energy N2 - In the following paper a combined optimization of a coupled electricity and gas system is presented. For the electricity network a unit commitment problem with optimization of energy and reserves under a power pool, considering all system operational and unit technical constraints is solved. The gas network subproblem is a medium-scale mixed-integer nonconvex and nonlinear programming problem. The coupling constraints between the two networks are nonlinear as well. The resulting mixed-integer nonlinear program is linearized with the extended incremental method and an outer approximation technique. The resulting model is evaluated using the Greek power and gas system comprising fourteen gas-fired units under four different approximation accuracy levels. The results indicate the efficiency of the proposed MIP model and the interplay between computational requirements and accuracy. KW - Electricity System KW - Natural Gas System KW - Mixed-Integer (Non)Linear Programming KW - Extended Incremental Method KW - Outer Approximation Y1 - 2017 U6 - https://doi.org/10.1007/s40565-017-0275-2 VL - 5 IS - 3 SP - 364 EP - 374 ER - TY - JOUR A1 - Gugat, Martin A1 - Leugering, Günter A1 - Martin, Alexander A1 - Schmidt, Martin A1 - Sirvent, Mathias A1 - Wintergerst, David T1 - Towards Simulation Based Mixed-Integer Optimization with Differential Equations JF - Networks N2 - We propose a decomposition based method for solving mixed-integer nonlinear optimization problems with “black-box” nonlinearities, where the latter, e.g., may arise due to differential equations or expensive simulation runs. The method alternatingly solves a mixed-integer linear master problem and a separation problem for iteratively refining the mixed-integer linear relaxation of the nonlinear equalities. The latter yield nonconvex feasible sets for the optimization model but we have to restrict ourselves to convex and monotone constraint functions. Under these assumptions, we prove that our algorithm finitely terminates with an approximate feasible global optimal solution of the mixed integer nonlinear problem. Additionally, we show the applicability of our approach for three applications from optimal control with integer variables, from the field of pressurized flows in pipes with elastic walls, and from steady-state gas transport. For the latter we also present promising numerical results of our method applied to real-world instances that particularly show the effectiveness of our method for problems defined on networks. KW - Mixed-Integer Optimization KW - Simulation Based Optimization KW - Optimization with Differential Equations KW - Decomposition Method KW - Gas Transport Networks Y1 - 2018 U6 - https://doi.org/10.1002/net.21812 ER - TY - JOUR A1 - Rüffler, Fabian A1 - Hante, Falk T1 - Optimal Switching for Hybrid Semilinear Evolutions JF - Nonlinear Analysis: Hybrid Systems Y1 - 2016 U6 - https://doi.org/10.1016/j.nahs.2016.05.001 VL - 22 SP - 215 EP - 227 ER -