Convex Relaxation of Optimal Power Flow, Part II: Exactness
Optimization and Control
2016-11-18 v1 Systems and Control
Abstract
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 models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact.
Keywords
Cite
@article{arxiv.1405.0814,
title = {Convex Relaxation of Optimal Power Flow, Part II: Exactness},
author = {Steven H. Low},
journal= {arXiv preprint arXiv:1405.0814},
year = {2016}
}
Comments
Citation: IEEE Transactions on Control of Network Systems, June 2014. This is an extended version with Appendex VI that proves the main results in this tutorial