Solving Bilevel AC OPF Problems by Smoothing the Complementary Conditions -- Part I: Model Description and the Algorithm
The existing research on market price-affecting agents, i.e. price makers, neglects or simplifies the nature of AC power flows in the power system as it predominantly relies on DC power flows. This paper proposes a novel bilevel formulation based on the smoothing technique, where any price-affecting strategic player can be modelled in the upper level, while the market clearing problem in the lower level uses convex quadratic transmission AC optimal power flow (AC OPF), with the goal of achieving accuracy close to the one of the exact nonlinear formulations. Achieving convexity in the lower level is the foundation for bilevel modeling since traditional single-level reduction techniques do not hold for nonconvex models. The bilevel market participation problem with the AC OPF formulation in the lower level is transformed into a single-level problem and solved using multiple techniques such as the primal-dual counterpart, the strong duality theorem, the McCormick envelopes, the complementary slackness, the penalty factor, the interaction discretization as well as the proposed smoothing techniques. Due to an extensive amount of information and descriptions, the overall work is presented as a two-part paper. This first part provides a literature overview, positions the work and presents the model and the solution algorithm, while the solution techniques and case studies are provided in the accompanying paper.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Solving Bilevel AC OPF Problems by Smoothing the Complementary Conditions -- Part II: Solution Techniques and Case Study
This is a second part of the research on AC optimal power flow being used in the lower level of the bilevel strategic bidding or investment models. As an example of a suitable upper-level problem, we observe a strategic …
Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing
In this paper, we study and analyze zeroth-order stochastic approximation algorithms for solving bilvel problems, when neither the upper/lower objective values, nor their unbiased gradient estimates are available. In par…
Bilevel OptimizationPenalty Method for Inversion-Free Deep Bilevel Optimization
Solving a bilevel optimization problem is at the core of several machine learning problems such as hyperparameter tuning, data denoising, meta- and few-shot learning, and training-data poisoning. Different from simultane…
Bilevel OptimizationData PoisoningDenoisingFew-Shot LearningA New Computational Approach for Solving Linear Bilevel Programs Based on Parameter-Free Disjunctive Decomposition
Linear bilevel programs (linear BLPs) have been widely used in computational mathematics and optimization in several applications. Single-level reformulation for linear BLPs replaces the lower-level linear program with i…
The structure of optimal parameters for image restoration problems
We study the qualitative properties of optimal regularisation parameters in variational models for image restoration. The parameters are solutions of bilevel optimisation problems with the image restoration problem as co…
Image Restoration