期刊
IEEE TRANSACTIONS ON POWER SYSTEMS
卷 29, 期 2, 页码 978-979出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2013.2288009
关键词
Global optimization; optimal power flow
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据