• Corpus ID: 52193722

Optimization-Based Bound Tightening using a Strengthened QC-Relaxation of the Optimal Power Flow Problem

  title={Optimization-Based Bound Tightening using a Strengthened QC-Relaxation of the Optimal Power Flow Problem},
  author={Kaarthik Sundar and Harsha Nagarajan and Sidhant Misra and Mowen Lu and Carleton Coffrin and Russell Bent},
This article develops a strengthened convex quadratic convex (QC) relaxation of the AC Optimal Power Flow (AC-OPF) problem and presents an optimization-based bound-tightening (OBBT) algorithm to compute tight, feasible bounds on the voltage magnitude variables for each bus and the phase angle difference variables for each branch in the network. Theoretical properties of the strengthened QC relaxation that show its dominance over the other variants of the QC relaxation studied in the literature… 

Figures and Tables from this paper

Tightening QC Relaxations of AC Optimal Power Flow Problems via Complex Per Unit Normalization
Optimal power flow (OPF) is a key problem in power system operations. OPF problems that use the nonlinear AC power flow equations to accurately model the network physics have inherent challenges
Generalized Convex Hull Pricing for the AC Optimal Power Flow Problem
This is the first proposed method of approximating CHPs in polynomial-time that is general enough to accommodate the nonlinear transmission constraints in the AC optimal power flow (OPF) problem.
Robust Optimization for Electricity Generation February 13 , 2021
We consider a robust optimization problem in an electric power system under uncertain demand and availability of renewable energy resources. Solving the deterministic alternating current optimal
Robust Optimization for Electricity Generation
Experimental results indicate that the robust convex relaxation of the ACOPF problem can provide a tight upper bound and a cutting-plane method to solve this robust optimization problem is proposed.
Robust Optimization for Electricity Generation September 13 , 2019
We consider a robust optimization problem in an electric power system under uncertain demand and availability of renewable energy resources. Solving the deterministic alternating current optimal
Notes on BIM and BFM Optimal Power Flow With Parallel Lines and Total Current Limits
It is shown that in meshed networks with parallel lines, BIM dominates BFM, and novel constraints to make them equivalent in general are proposed, tightening the second-order cone relaxation gap on test cases in the ‘PG Lib’ optimal power flow benchmark library.
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.
Optimal crashing of an activity network with disruptions
In this paper, we consider an optimization problem involving crashing an activity network under a single disruption. A disruption is an event whose magnitude and timing are random. When a disruption
An Ecological Robustness Oriented Optimal Power Flow for Power Systems' Survivability
—Traditional optimal power flow (OPF) ensures power systems are operated safely at minimum cost. Recent disasters have highlighted that a focus on minimizing cost can result in a fragile system, such


Strengthening Convex Relaxations with Bound Tightening for Power Network Optimization
It is shown that the Quadratic Convex relaxation of power flows, enhanced by bound tightening, almost always outperforms the state-of-the-art Semi-Definite Programming relaxation on the optimal power flow problem.
Bound Tightening for the Alternating Current Optimal Power Flow Problem
We consider the Alternating Current Optimal Power Flow (ACOPF) problem, formulated as a nonconvex Quadratically-Constrained Quadratic Program (QCQP) with complex variables. ACOPF may be solved to
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.
The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow
Convex relaxations of the power flow equations and, in particular, the semi-definite programming (SDP) and second-order cone (SOC) relaxations, have attracted significant interest in recent years.
Global Solution Strategies for the Network-Constrained Unit Commitment Problem With AC Transmission Constraints
We propose a novel global solution algorithm for the network-constrained unit commitment problem that incorporates a nonlinear alternating current (ac) model of the transmission network, which is a
Comparison of Various Trilinear Monomial Envelopes for Convex Relaxations of Optimal Power Flow Problems
Empirical results show that QC formulations using MF and EP envelopes give tighter bounds than those using RMC envelopes, and indicate that the EP envelops have advantages over MF envelopes with respect to computational speed and numerical stability when used with state-of-the-art second-order cone programming solvers.
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.
AC-Feasibility on Tree Networks is NP-Hard
It is shown that ac-feasibility, i.e., to find whether some generator dispatch can satisfy a given demand, is NP-hard for tree networks.
Semidefinite programming for optimal power flow problems
Convex Relaxations in Power System Optimization, A Brief Introduction
The aim of the videos is to provide the high level ideas of convex Relaxations and their applications in power system optimization, and could be used as a starting point for researchers who want to study, use or develop new convex relaxations for use in their own research.