skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Resistive Network Optimal Power Flow: Uniqueness and Algorithms

Abstract

The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.

Authors:
; ;
Publication Date:
Sponsoring Org.:
USDOE Advanced Research Projects Agency - Energy (ARPA-E)
OSTI Identifier:
1211452
DOE Contract Number:
DE-AR0000226
Resource Type:
Journal Article
Resource Relation:
Journal Name: IEEE Transactions on Power Systems; Journal Volume: 30; Journal Issue: 1
Country of Publication:
United States
Language:
English

Citation Formats

Tan, CW, Cai, DWH, and Lou, X. Resistive Network Optimal Power Flow: Uniqueness and Algorithms. United States: N. p., 2015. Web. doi:10.1109/TPWRS.2014.2329324.
Tan, CW, Cai, DWH, & Lou, X. Resistive Network Optimal Power Flow: Uniqueness and Algorithms. United States. doi:10.1109/TPWRS.2014.2329324.
Tan, CW, Cai, DWH, and Lou, X. Thu . "Resistive Network Optimal Power Flow: Uniqueness and Algorithms". United States. doi:10.1109/TPWRS.2014.2329324.
@article{osti_1211452,
title = {Resistive Network Optimal Power Flow: Uniqueness and Algorithms},
author = {Tan, CW and Cai, DWH and Lou, X},
abstractNote = {The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.},
doi = {10.1109/TPWRS.2014.2329324},
journal = {IEEE Transactions on Power Systems},
number = 1,
volume = 30,
place = {United States},
year = {Thu Jan 01 00:00:00 EST 2015},
month = {Thu Jan 01 00:00:00 EST 2015}
}