文件名称:Zero Duality Gap in Optimal Power Flow Problem
文件大小:482KB
文件格式:PDF
更新时间:2018-01-29 17:28:26
Power flow
The optimal power flow (OPF) problem is nonconvex and generally hard to solve. In this paper,we propose a semidefinite programming (SDP) optimization, which is the dual of an equivalent form of the OPF problem. A global optimum solution to the OPF problem can be retrieved from a solution of this convex dual problem whenever the duality gap is zero. A necessary and sufficient condition is provided in this paper to guarantee the existence of no duality gap for the OPF problem. This condition is satisfied by the standard IEEE benchmark systems with 14, 30, 57, 118, and 300 buses as well as several randomly generated systems. Since this condition is hard to study, a sufficient zero-duality-gap condition is also derived. This sufficient condition holds for IEEE systems after small resistance (