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 条
12345