On the Exactness of Convex Relaxation for Optimal Power Flow in Tree Networks

被引:0
|
作者
Gan, Lingwen [1 ]
Li, Na [1 ]
Topcu, Ufuk
Low, Steven [1 ]
机构
[1] CALTECH, Div Engn & Appl Sci, Pasadena, CA 91125 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The optimal power flow problem is nonconvex, and a convex relaxation has been proposed to solve it. We prove that the relaxation is exact, if there are no upper bounds on the voltage, and any one of some conditions holds. One of these conditions requires that there is no reverse real power flow, and that the resistance to reactance ratio is non-decreasing as transmission lines spread out from the substation to the branch buses. This condition is likely to hold if there are no distributed generators. Besides, avoiding reverse real power flow can be used as rule of thumb for placing distributed generators.
引用
收藏
页码:465 / 471
页数:7
相关论文
共 50 条
  • [41] Recover feasible solutions for SOCP relaxation of optimal power flow problems in mesh networks
    Tian, Zhuang
    Wu, Wenchuan
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2019, 13 (07) : 1078 - 1087
  • [42] Optimization of Distributed Energy Resources in Distribution Networks: Applications of Convex Optimal Power Flow Formulations in Distribution Networks
    Osorio, Diego Mendoza
    Garcia, Javier Rosero
    INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS, 2023, 2023
  • [43] Globally solving a class of optimal power flow problems in radial networks by tree reduction
    Beck, Amir
    Beck, Yuval
    Levron, Yoash
    Shtof, Alex
    Tetruashvili, Luba
    JOURNAL OF GLOBAL OPTIMIZATION, 2018, 72 (03) : 373 - 402
  • [44] An Exact Convex Formulation of the Optimal Power Flow in Radial Distribution Networks Including Transverse Components
    Nick, Mostafa
    Cherkaoui, Rachid
    Le Boudec, Jean-Yves
    Paolone, Mario
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 63 (03) : 682 - 697
  • [45] The Convex-Relaxation-Based Method for Power Flow Analysis
    Chen, Yuwei
    Yang, Wenbin
    Chen, Qing
    Li, Hongke
    Xu, Han
    Yin, Gui
    2022 34TH CHINESE CONTROL AND DECISION CONFERENCE, CCDC, 2022, : 5910 - 5915
  • [46] A Distributed Convex Relaxation Approach to Solve the Power Flow Problem
    Manshadi, Saeed D.
    Liu, Guangyi
    Khodayar, Mohammad E.
    Wang, Jianhui
    Dai, Renchang
    IEEE SYSTEMS JOURNAL, 2020, 14 (01): : 803 - 812
  • [47] Sufficient Conditions for Exact Semidefinite Relaxation of Optimal Power Flow in Unbalanced Multiphase Radial Networks
    Zhou, Fengyu
    Chen, Yue
    Low, Steven H.
    2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 6227 - 6233
  • [48] Load Flow Optimization of Meshed Networks: A Convex Relaxation and An Illustrative Example
    Chen, Yuwei
    Xiang, Ji
    Li, Yanjun
    PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 2200 - 2205
  • [49] Convex Relaxation and Decomposition in Large Resistive Power Networks with Energy Storage
    Lou, Xin
    Tan, Chee Wei
    2013 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM), 2013, : 642 - 647
  • [50] Sparse Tableau Relaxation for the Optimal Power Flow Problem
    Park, Byungkwon
    DeMarco, Christopher L.
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 315 - 323