Tight-and-cheap conic relaxation for the optimal reactive power dispatch problem

The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating the reactive power, such as shunt elements and tap changers, are considered. The ORPD problem is modelled as a mixed-integer nonlinear optimiz...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-05
Main Authors: Bingane, Christian, Anjos, Miguel F, Sébastien Le Digabel
Format: Article
Language:English
Subjects:
Nonlinear programming
Optimization
Power dispatch
Power flow
Reactive power
Tap changers
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating the reactive power, such as shunt elements and tap changers, are considered. The ORPD problem is modelled as a mixed-integer nonlinear optimization problem and its complexity is increased compared to the ACOPF problem, which is highly nonconvex and generally hard to solve. Recently, convex relaxations of the ACOPF problem have attracted a significant interest since they can lead to global optimality. We propose a tight conic relaxation of the ORPD problem and show that a round-off technique applied with this relaxation leads to near-global optimal solutions with very small guaranteed optimality gaps, unlike with the nonconvex continuous relaxation. We report computational results on selected MATPOWER test cases with up to 3375 buses.
ISSN:2331-8422
DOI:10.48550/arxiv.1810.03040