arXiv Analytics

Sign in

arXiv:1405.0814 [math.OC]AbstractReferencesReviewsResources

Convex Relaxation of Optimal Power Flow, Part II: Exactness

Steven H. Low

Published 2014-05-05Version 1

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.

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
Journal: S. H. Low. Convex Relaxation of Optimal Power Flow, Part II: Exactness, IEEE Transactions on Control of Network Systems, June 2014
Categories: math.OC, cs.SY
Related articles: Most relevant | Search more
arXiv:1405.0766 [math.OC] (Published 2014-05-05)
Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence
arXiv:2204.00191 [math.OC] (Published 2022-04-01)
Wasserstein Two-Sided Chance Constraints with An Application to Optimal Power Flow
arXiv:1504.00057 [math.OC] (Published 2015-03-31)
Optimal Power Flow with Weighted Chance Constraints and General Policies for Generation Control

Links

Toolbox