说明: 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 p
<junbozhao> 上传 | 大小:482kb