A Sufficient Condition for Global Optimality of Solutions to the Optimal Power Flow Problem

被引：46
|
作者：
Molzahn, Daniel K. [2 ]
Lesieutre, Bernard C. [1 ]
DeMarco, Christopher L. [1 ]
机构：
[1] Univ Wisconsin, Dept Elect & Comp Engn, Madison, WI 53706 USA
[2] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
来源：
IEEE TRANSACTIONS ON POWER SYSTEMS | 2014年 / 29卷 / 02期
关键词：
Global optimization; optimal power flow;
D O I：
10.1109/TPWRS.2013.2288009
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Recent applications of a semidefinite programming (SDP) relaxation to the optimal power flow (OPF) problem offers a polynomial time method to compute a global optimum for a large subclass of OPF problems. In contrast, prior OPF solution methods in the literature guarantee only local optimality for the solution produced. However, solvers employing SDP relaxation remain significantly slower than mature OPF solution codes. This letter seeks to combine the advantages of the two methods. In particular, we develop an SDP-inspired sufficient condition test for global optimality of a candidate OPF solution. This test may then be easily applied to a candidate solution generated by a traditional, only-guaranteed-locally-optimal OPF solver.
引用
收藏
页码：978 / 979
页数：2
相关论文
共 50 条
  • [41] Application of improved bat algorithm in optimal power flow problem
    Yanbin Yuan
    Xiaotao Wu
    Pengtao Wang
    Xiaohui Yuan
    Applied Intelligence, 2018, 48 : 2304 - 2314
  • [42] Optimal Power Flow Problem Solution Through a Matheuristic Approach
    Home-Ortiz, Juan M.
    Claro De Oliveira, Wmerson
    Sanches Mantovani, Jose Roberto
    IEEE ACCESS, 2021, 9 : 84576 - 84587
  • [43] Augmented Lagrangian Guided Learning for the Optimal Power Flow Problem
    Bouchkati, Sarra
    Lutat, Philipp
    Boettcher, Luis
    Klein-Helmkamp, Florian
    Ulbig, Andreas
    IFAC PAPERSONLINE, 2024, 58 (13): : 50 - 55
  • [44] Multiobjective particle swarm optimization for optimal power flow problem
    Abido, M. A.
    2008 12TH INTERNATIONAL MIDDLE EAST POWER SYSTEM CONFERENCE, VOLS 1 AND 2, 2008, : 485 - 489
  • [45] A SOCP Relaxation for Cycle Constraints in the Optimal Power Flow Problem
    Soofi, Arash Farokhi
    Manshadi, Saeed D.
    Liu, Guangyi
    Dai, Renchang
    IEEE TRANSACTIONS ON SMART GRID, 2021, 12 (02) : 1663 - 1673
  • [46] Convex Relaxation for Optimal Power Flow Problem: A Recent Review
    Lin Z.
    Hu Z.
    Song Y.
    Zhongguo Dianji Gongcheng Xuebao/Proceedings of the Chinese Society of Electrical Engineering, 2019, 39 (13): : 3717 - 3727
  • [47] Ant Colony Search Algorithm for the Optimal Power Flow Problem
    Soares, J.
    Sousa, T.
    Vale, Z. A.
    Morais, H.
    Faria, P.
    2011 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING, 2011,
  • [48] A SDP relaxation of an optimal power flow problem for distribution networks
    Desveaux, Vivien
    Handa, Marouan
    OPTIMIZATION AND ENGINEERING, 2023, 24 (04) : 2973 - 3002
  • [49] Application of improved bat algorithm in optimal power flow problem
    Yuan, Yanbin
    Wu, Xiaotao
    Wang, Pengtao
    Yuan, Xiaohui
    APPLIED INTELLIGENCE, 2018, 48 (08) : 2304 - 2314
  • [50] Crow search algorithm for solving optimal power flow problem
    Saha, Anulekha
    Bhattacharya, Aniruddha
    Das, Priyanath
    Chakraborty, Ajoy Kumar
    PROCEEDINGS OF THE 2017 IEEE SECOND INTERNATIONAL CONFERENCE ON ELECTRICAL, COMPUTER AND COMMUNICATION TECHNOLOGIES (ICECCT), 2017,
12345