Convex power flow models for scalable electricity market modelling

  title={Convex power flow models for scalable electricity market modelling},
  author={Frederik Geth and Reinhilde D’hulst and Dirk Van Hertem},
Optimal power flow problems and market clearing approaches are converging: cost-optimal scheduling of loads and generators should be performed while taking the grid’s physics and operational envelopes into account. Within the SmartNet project, the idea is to consider the grid’s physical behaviour in market clearing approaches. Taking the physics of power flow into account, while managing solution times, demands pragmatic approaches. Convex relaxation and linear approximation are two such… 

Figures from this paper

Optimal Flexibility Dispatch Problem Using Second-Order Cone Relaxation of AC Power Flows
A novel optimization method to solve the optimal flexibility dispatch problem for a system operator such that it deploys the demand response resource effectively and gives the locational pricing of flexibility services is proposed.
A Linear Model for Distributed Flexibility Markets and DLMPs: A Comparison with the SOCP Formulation
This paper examines the performance trade-offs between an introduced linear flexibility market model for congestion management and a benchmark second-order cone programming (SOCP) formulation. The
Optimal Power Flow for AC–DC Grids: Formulation, Convex Relaxation, Linear Approximation, and Implementation
An optimal power flow model for ac and dc grids is developed and a convex relaxation formulation of a parameterized ac–dc converter model is developed in an open-source tool.
A Survey of Relaxations and Approximations of the Power Flow Equations
This monograph provides the first comprehensive survey of representations in the context of optimization of the power flow equations, categorized as either relaxations or approximations.
Modeling of Complex Systems Including Transmission, Distribution, Aggregation, Ancillary Services Markets
This chapter provides mathematical models of different market framework components: aggregation of flexibility offers from DERs, ancillary services (AS) market architecture, market arbitrage, transmission, and distribution network models.
TSO-DSO coordination and market architectures for an integrated ancillary services acquisition: the view of the SmartNet project
The present paper summarizes the achievements of SmartNet during the first two project years and focuses on the set-up of the simulation platform and on the modelling of the different components.
Design of Local Services Markets for Pricing DSO-TSO Procurement Coordination
This paper assesses the conflict cost of two possible market schemes: in the first one only TSO can access DER flexibility, whereas in the second case DSOs lead the TSOs in the procurement of Der flexibility.
ACOPF for three‐phase four‐conductor distribution systems: semidefinite programming based relaxation with variable reduction and feasible solution recovery
Numerical studies on a modified IEEE 123-bus system show the effectiveness of the proposed SDP relaxation model with variable reductions and the feasible solution recovery process for three-phase four-conductor configured distribution systems.


Moment-based relaxation of the optimal power flow problem
This paper investigates "moment-based" relaxations of the OPF problem developed from polynomial optimization theory, finding moment relaxations are generally tighter than relaxations employed in previous research, thus resulting in global solutions for a broader class of OPF problems.
DC Power Flow Revisited
Linear MW-only ldquodcrdquo network power flow models are in widespread and even increasing use, particularly in congestion-constrained market applications. Many versions of these approximate models
Local Solutions of the Optimal Power Flow Problem
The existence of locally optimal solutions to the AC optimal power flow problem (OPF) has been a question of interest for decades. This paper presents examples of local optima on a variety of test
Radial distribution load flow using conic programming
  • R. Jabr
  • Mathematics
    IEEE Transactions on Power Systems
  • 2006
This paper shows that the load flow problem of a radial distribution system can be modeled as a convex optimization problem, particularly a conic program. The implications of the conic programming
Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
  • S. Low
  • Mathematics, Computer Science
    IEEE Transactions on Control of Network Systems
  • 2014
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow
Optimal capacitor placement on radial distribution systems
The problem of capacitor placement on a radial distribution system is formulated and a solution algorithm is proposed. The location, type, and size of capacitors, voltage constraints, and load
Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
A set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems, providing an interesting alternative to state-of-the-art semidefinite programming relaxations.
A rank minimization algorithm to enhance semidefinite relaxations of Optimal Power Flow
  • Raphael Louca, P. Seiler, E. Bitar
  • Mathematics, Computer Science
    2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2013
In this paper an iterative linearization-minimization algorithm is proposed to uncover rank-one solutions for the relaxation of the Optimal Power Flow problem, and a 14-bus example is provided for which this algorithm achieves a rank- one solution with a cost strictly lower than that obtained by a conventional solver.
Network flow and copper plate relaxations for AC transmission systems
Two intuitive linear relaxations of the power flow equations are developed, one based on classic network flow models (NF) and another inspired by copper plate approximations (CP), which provide a rich variety of tradeoffs between relaxation strength and performance.
Semidefinite programming for optimal power flow problems
Abstract This paper presents a new solution using the semidefinite programming (SDP) technique to solve the optimal power flow problems (OPF). The proposed method involves reformulating the OPF