Refine
Year of publication
Keywords
- Bilevel optimization (16)
- Gas networks (8)
- Optimal control (8)
- Robust optimization (8)
- Uniqueness (7)
- optimal control (7)
- Mixed-Integer Nonlinear Optimization (6)
- Mixed-integer optimization (6)
- Convergence (5)
- Mixed-integer nonlinear optimization (5)
- Mixed-integer programming (5)
- Networks (5)
- chance constraints (5)
- robust optimization (5)
- Branch-and-cut (4)
- Gas Networks (4)
- Linear complementarity problems (4)
- Mixed-Integer Nonlinear Programming (4)
- Multilevel Optimization (4)
- Perfect competition (4)
- Reformulations (4)
- Robust Optimization (4)
- gas networks (4)
- port-Hamiltonian systems (4)
- A posteriori error estimates (3)
- Alternating direction methods (3)
- Bilevel Optimization (3)
- District heating networks (3)
- Existence (3)
- Global Optimization (3)
- Mixed-integer linear optimization (3)
- Nodal Control (3)
- Nonlinear optimization (3)
- Penalty methods (3)
- Potential networks (3)
- Potential-based flows (3)
- Pricing (3)
- Probabilistic Constraints (3)
- Stochastic Programming (3)
- Time-domain decomposition (3)
- Turnpike (3)
- Turnpike phenomenon (3)
- chance constrained programming (3)
- isothermal Euler equations (3)
- optimality conditions (3)
- Adjustable Robustness (2)
- Big-M (2)
- Booking (2)
- Bookings (2)
- Bounded rationality (2)
- Branch-and-bound (2)
- Chance constraints (2)
- Combinatorial optimization (2)
- Complementarity constraints (2)
- Computational complexity (2)
- Electricity market equilibrium models (2)
- Energy markets (2)
- Equilibrium computation (2)
- European entry-exit market (2)
- Gas Market (2)
- Gas transport networks (2)
- Graph Partitioning (2)
- Keller-Segel (2)
- Kernel Density Estimator (2)
- Linear Complementarity Problems (2)
- Lipschitz Optimization (2)
- Market Equilibria (2)
- Mixed-Integer Optimization (2)
- Multilevel optimization (2)
- Multiplicity (2)
- Network design (2)
- Network expansion (2)
- Neural ODEs (2)
- Optimization under uncertainty (2)
- PDE constrained optimization (2)
- Piecewise Linearization (2)
- Potential-Based Flows (2)
- Riccati equations (2)
- Semidefinite Programming (2)
- Semilinear hyperbolic systems (2)
- Space- and time-domain decomposition (2)
- Spheric Radial Decomposition (2)
- a posteriori error analysis (2)
- chance constraint (2)
- condition number (2)
- day-ahead bidding (2)
- deep learning (2)
- descriptor systems (2)
- electricity market (2)
- error analysis (2)
- exponential stability (2)
- gas compressor modeling (2)
- gas network (2)
- gradient descent (2)
- linear hyperbolic systems (2)
- linear systems (2)
- long time behavior (2)
- multi-leader-common-follower game (2)
- nonlinear diffusion (2)
- optimal nodal control (2)
- optimal power flow (2)
- p-Laplace problem on a graph (2)
- polyhedral model (2)
- shape optimization (2)
- spheric-radial decomposition (2)
- stochastic demand (2)
- 1-d wave equations (1)
- 28 (1)
- AC Optimal Power Flow (1)
- AC Power Flow (1)
- Abs-smooth Algorithmic Differentiation (1)
- Active Signature Method (1)
- Active elements (1)
- Adaptive Clustering (1)
- Adaptive error control (1)
- Adaptive methods (1)
- Agent-based models (1)
- Aggregation (1)
- Applications (1)
- Approximate feasibility (1)
- Averaged Control (1)
- Averaged controllability, averaged observability, observability, random heat equation (1)
- BV-coefficients (1)
- Benders Decomposition (1)
- Benders cuts (1)
- Binary-constrained mixed complementarity problems (1)
- Black-box Optimization (1)
- Black-box constraints (1)
- Boundary Control (1)
- Boundary feedback control, feedback stabilization, exponential stability, isothermal Euler equations, second-order quasilinear equation, Lyapunov function, stationary state, non-stationary state, gas pipeline. (1)
- Bounding polyhedra (1)
- Branch-and-Bound (1)
- Branch-and-Cut (1)
- Classical Solutions (1)
- Clique Problem (1)
- Competitive equilibrium (1)
- Complementarity Constraints (1)
- Complete description (1)
- Computational Analysis (1)
- Computational Complexity (1)
- Computational Equilibrium Models; Electricity Markets; Investment Incentives; Distribution Network Expansion Planning; Storage Investment and Operation; Renewable Energy Production; (Self-) Consumption (1)
- Computational analysis (1)
- Connectivity (1)
- Conservation laws (1)
- Constraints (1)
- Continuous Optimization (1)
- Continuous reformulations (1)
- Control Constraint (1)
- Controllability (1)
- Controlling Regulators and Compressors (1)
- Convex Envelope (1)
- Convex mixed-integer nonlinear optimization (1)
- Convexity (1)
- Cut-set inequalities (1)
- Cutting planes (1)
- Cycled Networks (1)
- DAE (1)
- DC Power Flow (1)
- Decomposition (1)
- Decomposition Method (1)
- Decomposition Methods (1)
- Demand Uncertainties (1)
- Demand side flexibility Load management Multi market bidding Stochastic programming Production planning Demand response (1)
- Derivative-free Optimization (1)
- Differential-algebraic equation (1)
- Differential-algebraic equations (1)
- Dirac structure (1)
- Direct methods (1)
- Dirichlet boundary control (1)
- Discrete Decisions (1)
- Discrete arc sizing (1)
- District heating network (1)
- Domain decomposition (1)
- Dynamic Network Flows (1)
- Dynamic Robust Flow (1)
- Electric fuels, Hydrogen Utilization, Hydrogen Import, LOHC, Mobility (1)
- Electricity Market Design} (1)
- Electricity Markets (1)
- Electricity Markets, Network Expansion, Generation Expansion, Investment Incentives, Computational Equilibrium Models (1)
- Electricity Markets, Network Expansion, Generation Expansion, Investment Incentives, Market Design, Congestion Management, Computational Equilibrium Models (1)
- Electricity Markets, Redispatch, Congestion Management, Computational Equilibrium Models (1)
- Electricity Networks (1)
- Electricity System (1)
- Electricity market design (1)
- Electricity market modeling (1)
- Electricity tariffs (1)
- Ellipsoidal uncertainty sets (1)
- Energy Markets (1)
- Energy Networks (1)
- Energy storage, Consumer segmentation, Adoption decision, Innovation diffusion (1)
- Energy-based formulation (1)
- Entry-Exit Gas Market (1)
- Entry-Exit System (1)
- Entry-exit system (1)
- Equilibrium Problems (1)
- Euler and St. Venant equations (1)
- Euler equations (1)
- Euler-Gleichungen, isotherme Euler-Gleichungen, Modellhierarchie, Netzelemente (1)
- European Entry-Exit Gas Market (1)
- European gas market (1)
- Exact control (1)
- Exact controllability (1)
- Extended Incremental Method (1)
- First-Discretize-Then-Optimize (1)
- Flow Networks (1)
- Flow models (1)
- Frank-Wolfe algorithm (1)
- Fundamental Welfare Theorems (1)
- Galerkin projection (1)
- Game Theory (1)
- Game theory (1)
- Gas Dynamics (1)
- Gas Market Design (1)
- Gas Network Optimization (1)
- Gas Pipelines (1)
- Gas Transport (1)
- Gas Transport Networks (1)
- Gas markets (1)
- Gas network optimization (1)
- GasLib (1)
- Generalized Benders Decomposition (1)
- Global classical solutions Ideal gas Bi-directional flow Transsonic flow (1)
- Global optimization (1)
- Graph decomposition (1)
- Graph partitioning (1)
- Guiding problem (1)
- H2-optimal (1)
- Hamilton-Jacobi-Bellman equations (1)
- Hardness (1)
- Heat equations with memory (1)
- Hyperbolic Balance Laws, Stabilization, Exact Controllability, Modeling of Gas Flow, Finite-Volume Schemes, Optimal control, Uncertainty (1)
- Illiquid investments (1)
- Index (1)
- Infinite-time admissibility (1)
- Instantaneous control (1)
- Interdiction Games (1)
- Inverse parametric quadratic programming (1)
- Investment Incentives (1)
- Isothermal Euler Equations (1)
- Isothermal stationary Euler equations (1)
- Knapsack interdiction (1)
- Kuramoto model (1)
- LQ optimal control problem (1)
- LQG control design (1)
- Least-Squares Collocation Method (1)
- Lecture Notes (1)
- Limited observability (1)
- Linear Bilevel Optimization (1)
- Linear Recourse (1)
- Linear prices (1)
- Linear programs with complementarity constraints (1)
- Lipschitz continuity (1)
- Lipschitz optimization (1)
- MINLP (1)
- MINLP model (1)
- MPCC (1)
- MPEC (1)
- Market power (1)
- Marking strategy (1)
- Mathematical Gas Network Models, Stochastic Nomination Validation, Parametric Models (1)
- Mathematical Programs with Equilibrium Constraints, probabilistic con- straints, M-stationarity conditions, calmness (1)
- Mathematical biology (1)
- Mathematical programs with complementarity constraints (MPCC) (1)
- Max-cut (1)
- Maximum flow problem (1)
- Measure Turnpike (1)
- Measure turnpike (1)
- Mixed-Integer (Non)Linear Programming (1)
- Mixed-Integer Linear Complementarity Problems (1)
- Mixed-Integer Nonlinear Optimization, Global Optimization, Lipschitz Optimization, Gas Networks (1)
- Mixed-Integer Nonlinear Optimization, Lipschitz Optimization, Inexact Function Evaluations, Decomposition Methods, Gas Networks (1)
- Mixed-Integer Programming (1)
- Mixed-integer Nonlinear Optimization (1)
- Mixed-integer bilevel optimization (1)
- Mixed-integer nonlinear programming (1)
- Mixed-integer optimal control (1)
- Mixed-integer optimal control problems (1)
- Mixing (1)
- Model Predictive Control (1)
- Model hierarchy (1)
- Modeling (1)
- Multi-leader multi-follower game (1)
- Multilevel Modeling (1)
- Multilevel programming (1)
- Multiple-Choice Constraints (1)
- Multistage stochastic optimization (1)
- NP-Hardness (1)
- Nash Games (1)
- Nash-Cournot competition (1)
- Nash-Cournot equilibria (1)
- Natural Gas Markets (1)
- Natural Gas System (1)
- Neighboring Markets (1)
- Network (1)
- Network Expansion (1)
- Network Optimization (1)
- Network flow problems (1)
- Network reduction (1)
- Neumann boundary control (1)
- Neural networks (1)
- Nodal Stabilization (1)
- Nomination (1)
- Nonconvex Equilibrium Models (1)
- Nonconvex games (1)
- Nonconvex lower levels (1)
- Nonlinear Flows (1)
- Nonsmooth Optimization (1)
- Numerical Integration (1)
- OR in energy (1)
- Optimal Transport (1)
- Optimal control problems (1)
- Optimal control, Gas networks, Euler's equation, Semilinear PDE, Nonoverlapping domain decomposition (1)
- Optimal shape design (1)
- Optimal value function (1)
- Optimality system (1)
- Optimization (1)
- Optimization with Differential Equations (1)
- Optimization with differential equations (1)
- Outer Approximation (1)
- Outer approximation (1)
- PDAE (1)
- PDE constrained optimization, probabilistic constraints, uncertain initial data (1)
- PDE-constrained optimization (1)
- PDEs on graphs (1)
- Parabolic equation (1)
- Parameter-dependent systems (1)
- Parametric optimization (1)
- Partial differential equations (1)
- Partial differential equations on graphs (1)
- Partial differential equations on networks (1)
- Peak-Load Pricing (1)
- Peak-load pricing (1)
- Penalty Methods (1)
- Penalty method (1)
- Perfect Competition (1)
- Piecewise Linear Relaxation (1)
- Piecewise linear functions (1)
- Pilot projects, Organizational setup, Adoption decision, Quadruple Helix, Innovation diffusion (1)
- Policy risk (1)
- Polyhedral demand uncertainty (1)
- Port-Hamiltonian model framework (1)
- Portfolio optimization (1)
- Potential-based Networks (1)
- Potential-based flows, Gas networks, Computational complexity, European entry-exit market, Bookings (1)
- Power-to-Gas (1)
- Presolve (1)
- Price Zones (1)
- Primal Heuristic (1)
- Probabilistic Robustness (1)
- Probabilistic constraints (1)
- Problem Instances (1)
- Quadratic programming (1)
- Quantile Minimization (1)
- R-vine copula (1)
- Random Batch Method (1)
- Random Boundary Data (1)
- Reaction-diffusion (1)
- Regional Pricing (1)
- Remove term: Hamilton-Jacobi equation Hamilton-Jacobi equation (1)
- Renewables (1)
- Residual Neural Networks (1)
- Risk Aversion (1)
- Robust Optimization, Mixed-integer programming, Uncertainty sets, Robust feasibility (1)
- Robust market equilibria (1)
- Robust network design (1)
- SALMIN (1)
- SOS-1 (1)
- Scenario generation (1)
- Scheduling (1)
- Second-Order Cone Programming (1)
- Sector Coupling (1)
- Sector Coupling, Eletricity Markets, Electric fuels, Hydrogen Utilization, LOHC, Mobility (1)
- Separation under uncertainty (1)
- Series-parallel graphs (1)
- Set Point Values (1)
- Short- and Long-Run Market Equilibrium (1)
- Simulation Based Optimization (1)
- Simulation of Gas Transportation Networks (1)
- Simultaneous Convexification (1)
- Spatial price equilibria (1)
- Spatial price equilibrium problems (1)
- State constraint (1)
- Stationary points (1)
- Storage Capacity Maximization (1)
- Strict dissipativity (1)
- Strong Convexity (1)
- Supervised Learning (1)
- Supply chain (1)
- Survey (1)
- Target Values (1)
- Tariff design (1)
- Technical Capacities (1)
- Thermodynamic fluid flow (1)
- Total Unimodularity (1)
- Total unimodularity (1)
- Tractable counterparts (1)
- Traffic equilibrium problems (1)
- Traffic flow (1)
- Transient Gas Transport Optimization (1)
- Transmission and generation investment (1)
- Transmission management (1)
- Transport Costs (1)
- Transport Equation (1)
- Trees (1)
- Uncertain Travel Times (1)
- Unit Commitment with AC Power Flow (1)
- Unknown follower problems (1)
- Valid Inequalities (1)
- Valid inequalities (1)
- Validation of nominations, Stationary states, Isothermal Euler equations, Gas networks, Convexity, Star-Shapedness, Spheric-radial decomposition (1)
- Validation of nominations, Stationary states, Isothermal Euler equations, Ideal Gas, Gas network, Gas transport, Compressor control, Uncertainty, Chance Constraints, Spheric-radial decomposition (1)
- Value-at-Risk (VaR) (1)
- a posteriori error estimates (1)
- abs-smooth functions (1)
- accuracy (1)
- acyclic flows (1)
- ammonia trade (1)
- approximate convex decomposition (1)
- asymptotic limits (1)
- backward error (1)
- bilevel optimization (1)
- bound tightening (1)
- boundary control (1)
- branch-and-bound (1)
- calmness (1)
- case study Australia to Germany (1)
- chemotaxis (1)
- chemotaxis; (1)
- compressible fluid dynamics (1)
- compressor station (1)
- computational cost (1)
- conditional uncertainty set (1)
- conservation laws on network (1)
- constraint qualification (1)
- contact problem (1)
- convergence rate (1)
- convex hull reformulation (1)
- coupled oscillators (1)
- coupling conditions (1)
- data classification (1)
- data uncertainty (1)
- decision trees (1)
- decision-dependent uncertainty (1)
- decomposition of the flow (1)
- delay (1)
- differential-algebraic equation, higher index, essentially ill-posed problem, collocation, boundary value problem, initial value problem (1)
- differential-algebraic equations (1)
- discontinuous Galerkin scheme (1)
- discretization (1)
- disjunctive set (1)
- distributed parameter system (1)
- distributionally robust optimization (1)
- doubly nonlinear parabolic problems (1)
- dual weighted residual, hyperbolic problems, discontinuous Galerkin, artificial viscosity (1)
- dynamic control (1)
- energy decay (1)
- entropy conditions (1)
- entropy solutions (1)
- equilibrium constraints (1)
- error bound (1)
- error estimators (1)
- exact control (1)
- finite time blow-up (1)
- finite volume scheme (1)
- flow patterns (1)
- gas dynamics (1)
- gas pipeline flow (1)
- gas supply networks (1)
- gas transport (1)
- gas transport on networks (1)
- green ammonia (1)
- here-and-now decision (1)
- hierarchy of models (1)
- hybrid parabolic-hyperbolic behavior (1)
- hybrid system (1)
- hyperbolic balance laws (1)
- hyperbolic differential equation (1)
- hyperbolic system (1)
- instantaneous control (1)
- integral equations (1)
- inverse design problem (1)
- isothermal Euler equation (1)
- large scale complex systems (1)
- learning over time (1)
- linear-quadratic (1)
- long-time behavior (1)
- machine learning (1)
- measurement error (1)
- mixed-integer programming (1)
- model adaptivity (1)
- model hierarchy (1)
- model order reduction (1)
- model reformulation (1)
- multi-way compressor station (1)
- multilevel (1)
- network (1)
- network modelling (1)
- networks (1)
- nodal control (1)
- nodal profile con-trol (1)
- nonlinear model (1)
- nonlinear stochastic optimization (1)
- nonlocal conservation laws (1)
- nonoverlapping omain decomposition, optimal control of semi-linear ellioptic systems on netowrks (1)
- nonsmooth optimization (1)
- obstacle problems (1)
- optimal boundary control (1)
- optimal control, scalar conservation law, differentiability, adjoint state, shock sensitivity (1)
- optimal control, scalar conservation law, network (1)
- optimization model (1)
- p-parabolic problems (1)
- p-system (1)
- partial differential-algebraic equations (1)
- passivity (1)
- perturbation mapping (1)
- pipes (1)
- polynomial optimization (1)
- power networks (1)
- probabilistic constraints (1)
- probust constraints (1)
- quasilinear hyperbolic problem (1)
- random batch method (1)
- random demand (1)
- random forests (1)
- real gas (1)
- refinement strategies (1)
- regularization (1)
- relative energy estimates (1)
- relative entropy estimates (1)
- relaxations (1)
- renewable energy auction, combinatorial auction, market design (1)
- robust constraint (1)
- semi-infinite optimization (1)
- semiconcave envelopes (1)
- shocks, (1)
- simple layer potential (1)
- simultaneous control (1)
- simultaneous controllability (1)
- singular perturbations (1)
- spectral factorization (1)
- spherical cap discrepancy (1)
- spherical radial decomposition (1)
- state constraints (1)
- stationary gas networks, booked capacities, probabilistic constraints, constraint qualification, spheric-radial decomposition (1)
- stationary gas transport (1)
- statistical analysis (1)
- stochastic gradient method (1)
- stochastic optimization (1)
- structure preserving discretization (1)
- structure-preserving discretization (1)
- structure-preserving model order reduction (1)
- switched system (1)
- systems of hyperbolic pdes (1)
- the turnpike property (1)
- topological derivative (1)
- traveling waves (1)
- turnpike property (1)
- uncertainty quantification, Markov chain Monte Carlo, reliability of gas networks, nomination validation, spheric-radial decomposition (1)
- uncertainty set (1)
- uniform distribution on sphere (1)
- wave equation (1)
- z factor (1)
- Γ-robustness (1)
We study uncertain linear complementarity problems (LCPs), i.e., problems in which the LCP vector q or the LCP matrix M may contain uncertain parameters. To this end, we use the concept of Γ-robust optimization applied to the gap function formulation of the LCP. Thus, this work builds upon [16]. There, we studied Γ-robustified LCPs for l1- and box-uncertainty sets, whereas we now focus on ellipsoidal uncertainty set. For uncertainty in q or M, we derive conditions for the tractability of the robust counterparts. For these counterparts, we also give conditions for the existence and uniqueness of their solutions. Finally, a case study for the uncertain traffic equilibrium problem is considered, which illustrates the effects of the values of Γ on the feasibility and quality of the respective robustified solutions.
Complementarity problems are often used to compute equilibria made up of specifically coordinated solutions of different optimization problems. Specific examples are game-theoretic settings like the bimatrix game or energy market models like for electricity or natural gas. While optimization under uncertainties is rather well-developed, the field of equilibrium models represented by complementarity problems under uncertainty - especially using the concepts of robust optimization - is still in its infancy. In this paper, we extend the theory of strictly robust linear complementarity problems (LCPs) to Γ-robust settings, where existence of worst-case-hedged equilibria cannot be guaranteed. Thus, we study the minimization of the worst-case gap function of Γ-robust counterparts of LCPs. For box and l1-norm uncertainty sets we derive tractable convex counterparts for monotone LCPs and study their feasibility as well as the existence and uniqueness of solutions. To this end, we consider uncertainties in the vector and in the matrix defining the LCP. We additionally study so-called ρ-robust solutions, i.e., solutions of relaxed uncertain LCPs. Finally, we illustrate the Γ-robust concept applied to LCPs in the light of the above mentioned classical examples of bimatrix games and market equilibrium modeling.
We consider uncertain robust electricity market equilibrium problems including transmission and generation investments. Electricity market equilibrium modeling has a long tradition but is, in most of the cases, applied in a deterministic setting in which all data of the model are known. Whereas there exist some literature on stochastic equilibrium problems, the field of robust equilibrium models is still in its infancy. We contribute to this new field of research by considering Γ-robust electricity market equilibrium models on lossless DC networks with transmission and generation investments. We state the nominal market equilibrium problem as a mixed complementarity problem as well as its variational inequality and welfare optimization counterparts. For the latter, we then derive a Γ-robust formulation and show that it is indeed the counterpart of a market equilibrium problem with robustified player problems. Finally, we present two case studies to gain insights into the general effects of robustification on electricity market models. In particular, our case studies reveal that the transmission system operator tends to act more risk-neutral in the robust setting, whereas generating firms clearly behave more risk-averse.
Linear bilevel optimization problems have gained increasing attention both in theory as well as in practical applications of Operations Research (OR) during the last years and decades. The latter is mainly due to the ability of this class of problems to model hierarchical decision processes. However, this ability makes bilevel problems also very hard to solve. Since no general-purpose solvers are available, a "best-practice" has developed in the applied OR community, in which not all people want to develop tailored algorithms but "just use" bilevel optimization as a modeling tool for practice. This best-practice is the big-M reformulation of the Karush-Kuhn-Tucker (KKT) conditions of the lower-level problem - an approach that has been shown to be highly problematic by Pineda and Morales (2019). Choosing invalid values for M yields solutions that may be arbitrarily bad. Checking the validity of the big-Ms is however shown to be as hard as solving the original bilevel problem in Kleinert et al. (2019). Nevertheless, due to its appealing simplicity, especially w.r.t. the required implementation effort, this ready-to-use approach still is the most popular method. Until now, there has been a lack of approaches that are competitive both in terms of implementation effort and computational cost.
In this note we demonstrate that there is indeed another competitive ready-to-use approach: If the SOS-1 technique is applied to the KKT complementarity conditions, adding the simple additional root-node inequality developed by Kleinert et al. (2020) leads to a competitive performance - without having all the possible theoretical disadvantages of the big-M approach.
Transport and trade of gas are decoupled after the liberalization of the European gas markets, which are now organized as so-called entry-exit systems. At the core of this market system are bookings and nominations, two special capacity-right contracts that grant traders access to the gas network. The latter is operated by a separate entity, known as the transmission system operator (TSO), who is in charge of the transport of gas from entry to exit nodes. In the mid to long term, traders sign a booking contract with the TSO to obtain injection and withdrawal capacities at entry and exit nodes, respectively. On a day-ahead basis, they then nominate within these booked capacities a balanced load flow of the planned amounts of gas to be injected into and withdrawn from the network the next day. The key property is that by signing a booking contract, the TSO is obliged to guarantee transportability for all balanced load flows in compliance with the booked capacities. To assess the feasibility of a booking, it is therefore necessary to check the feasibility of infinitely many nominations. As a result, deciding if a booking is feasible is a challenging mathematical problem, which we investigate in this dissertation.
Our results range from passive networks, consisting of pipes only, to active networks, containing controllable elements to influence gas flows. Since the study of the latter naturally leads to a bilevel framework, we first consider some more general properties of bilevel optimization. For the case of linear bilevel optimization, we consider the hardness of validating the correctness of big-Ms often used in solving these problems via a single-level reformulation. We also derive a family of valid inequalities to be used in a bilevel-tailored branch-and-cut algorithm as a big-M-free alternative.
We then turn to the study of feasible bookings. First, we present our results on passive networks, for which bilevel approaches are not required. A characterization of feasible bookings on passive networks is derived in terms of a finite set of nominations. While computing these nominations is a difficult task in general, we present polynomial complexity results for the special cases of tree-shaped or single-cycle passive networks. Finally, we consider networks with linearly modeled active elements. After obtaining a bilevel optimization model that allows us to determine the feasibility of a booking in this case, we derive various single-level reformulations to solve the problem. In addition, we obtain novel characterizations of feasible bookings on active networks, which generalize our characterization in the passive case. The performance of these various approaches is compared in a case study on two networks from the literature, one of which is a simplified version of the Greek gas network.
Value at risk approach to producer's best response in electricity market with uncertain demand
(2021)
We deal with several sources of uncertainty in electricity markets. The independent system operator (ISO) maximizes the social welfare using chance constraints to hedge against discrepancies between the estimated and real electricity demand. We find an explicit solution of the ISO problem, and use it to tackle the problem of a producer. In our model, production as well as income of a producer are determined based on the estimated electricity demand predicted by the ISO, that is unknown to producers. Thus, each producer is hedging against the uncertainty of prediction of the demand using the value-at-risk approach. To illustrate our results, a numerical study of a producer's best response given a historical distribution of both estimated and real electricity demand is provided.
Bilevel problems are used to model the interaction between two decision makers in which the lower-level problem, the so-called follower's problem, appears as a constraint in the upper-level problem of the so-called leader. One issue in many practical situations is that the follower's problem is not explicitly known by the leader. For such bilevel problems with unknown lower-level model we propose the use of neural networks to learn the follower's optimal response for given decisions of the leader based on available historical data of pairs of leader and follower decisions. Integrating the resulting neural network in a single-level reformulation of the bilevel problem leads to a challenging model with a black-box constraint. We exploit Lipschitz optimization techniques from the literature to solve this reformulation and illustrate the applicability of the proposed method with some preliminary case studies using academic and linear bilevel instances.
This paper addresses unit commitment under uncertainty of load and power infeed from renewables in alternating current (AC) power systems. Beside traditional unit-commitment constraints, the physics of power flow are included. To gain globally optimal solutions a recent semidefinite programming approach is used, which leads us to risk averse two-stage stochastic mixed integer semidefinite programs for which a decomposition algorithm is presented.
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.
We study the existence and uniqueness of equilibria for perfectly competitive markets in capacitated transport networks. The model under consideration is rather general so that it captures basic aspects of related models in, e.g., gas or electricity networks. We formulate the market equilibrium model as a mixed complementarity problem and show the equivalence to a welfare maximization problem. Using the latter we prove uniqueness of the resulting equilibrium for piecewise linear and symmetric transport costs under additional mild assumptions. Moreover, we show the necessity of these assumptions by illustrating examples that possess multiple solutions if our assumptions are violated.