CONICOPF: Conic relaxations for AC optimal power flow computations

Computational speed and global optimality are key needs for practical algorithms for the optimal power flow problem. Two convex relaxations offer a favorable trade-off between the standard second-order cone and the standard semidefinite relaxations for large-scale meshed networks in terms of optimal...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-02
Main Authors: Bingane, Christian, Anjos, Miguel F, Sébastien Le Digabel
Format: Article
Language:English
Subjects:
Algorithms
Computation
Optimization
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Computational speed and global optimality are key needs for practical algorithms for the optimal power flow problem. Two convex relaxations offer a favorable trade-off between the standard second-order cone and the standard semidefinite relaxations for large-scale meshed networks in terms of optimality gap and computation time: the tight-and-cheap relaxation (TCR) and the quadratic convex relaxation (QCR). We compare these relaxations on 60 PGLib-OPF test cases with up to 1,354 buses under three operating conditions and show that TCR dominates QCR on all 20 typical (TYP) test cases, on 18 out of 20 active power increase (API), and 12 out of 20 small angle difference (SAD). Selected state-of-the-art conic relaxations are implemented in the new MATLAB-based package CONICOPF available on GitHub.
ISSN:2331-8422
DOI:10.48550/arxiv.1903.09678