Convex relaxation for mixed-integer optimal power flow problems

Chin-Yao Chang, Sonia Martínez, and Jorge Cortés
Proceedings of the 2017 55th Annual Allerton Conference on Communication, Control and Computing (Allerton), Monticello, IL, USA, October 2017

Abstract:

Recent years have witnessed the success of employing convex relaxations of the AC optimal power flow (OPF) problem to find global or near-global optimal solutions. The majority of the effort has focused on solving problem formulations where variables live in continuous spaces. Our focus here is in the extension of these results to the co-optimization of network topology and the OPF problem. We employ binary variables to model topology reconfiguration in the standard semidefinite programming (SDP) formulation of the OPF problem. This makes the problem non-convex, not only because the variables are binary, but also because of the presence of bilinear products between the binary and other continuous variables. Our proposed convex relaxation to this problem incorporates the bilinear terms in a novel way that improves over the commonly used McCormick approximation. We also address the exponential complexity associated with the discrete variables by partitioning the network graph in a way that minimizes the impact on the optimal value of the relaxation. As a result, the problem is broken down into several parallel mixed-integer problems, reducing the overall computational complexity. Simulations in the IEEE 118-bus test case demonstrate that our approach converges to solutions which are very close to the lower bound of the mixed-integer OPF problem.

File: main.pdf

Bib-tex entry:

@InProceedings{CYC-SM-JC:17-allerton},
author = {C.-Y. Chang and S. Mart{\'\i}nez and J. Cort\'es },
booktitle = {2017 55th Annual Allerton Conference on Communication, Control and Computing (Allerton)},
title = {Convex relaxation for mixed-integer optimal power flow problems},
month = {October},
year = {2017},
address ={Monticello, IL}
}