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
来源：
2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC) | 2012年
关键词：
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 条
  • [21] Convex Relaxation of AC Optimal Power Flow With Flexible Transmission Line Impedances
    Song, Yue
    Hill, David J.
    Liu, Tao
    Chen, Tianlun
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2022, 37 (04) : 3129 - 3132
  • [22] Low-Rank Solution of Convex Relaxation for Optimal Power Flow Problem
    Sojoudi, Somayeh
    Madani, Ramtin
    Lavaei, Javad
    2013 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM), 2013, : 636 - 641
  • [23] Recovery of Feasible Solution from Convex Relaxation of AC Optimal Power Flow
    Tiwari, Anamika
    Mohapatra, Abheejeet
    Sahoo, Soumya Ranjan
    2023 IEEE IAS GLOBAL CONFERENCE ON RENEWABLE ENERGY AND HYDROGEN TECHNOLOGIES, GLOBCONHT, 2023,
  • [24] A SDP relaxation of an optimal power flow problem for distribution networks
    Vivien Desveaux
    Marouan Handa
    Optimization and Engineering, 2023, 24 : 2973 - 3002
  • [25] A SDP relaxation of an optimal power flow problem for distribution networks
    Desveaux, Vivien
    Handa, Marouan
    OPTIMIZATION AND ENGINEERING, 2023, 24 (04) : 2973 - 3002
  • [26] Analysis of Semidefinite Programming Relaxation of Optimal Power Flow for Cyclic Networks
    Mahboubi, Hamid
    Lavaei, Javad
    2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2018, : 3203 - 3210
  • [27] A convex relaxation approach for power flow problem
    Saeed D.MANSHADI
    Guangyi LIU
    Mohammad E.KHODAYAR
    Jianhui WANG
    Renchang DAI
    Journal of Modern Power Systems and Clean Energy, 2019, 7 (06) : 1399 - 1410
  • [28] A convex relaxation approach for power flow problem
    Manshadi, Saeed D.
    Liu, Guangyi
    Khodayar, Mohammad E.
    Wang, Jianhui
    Dai, Renchang
    JOURNAL OF MODERN POWER SYSTEMS AND CLEAN ENERGY, 2019, 7 (06) : 1399 - 1410
  • [29] Sequential Convex optimization for the Dynamic Optimal Power Flow of Active Distribution Networks
    Sepulveda, Simon
    Garces, Alejandro
    Mora-Florez, Juan
    IFAC PAPERSONLINE, 2022, 55 (09): : 268 - 273
  • [30] Recursive Convex Model for Optimal Power Flow Solution in Monopolar DC Networks
    Danilo Montoya, Oscar
    Zishan, Farhad
    Armando Giral-Ramirez, Diego
    MATHEMATICS, 2022, 10 (19)
12345