solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看2743次
Convex Relaxation for Mixed-Integer Optimal Power Flow Problems. (arXiv:1710.02970v1 [math.OC])
来源于:arXiv
Recent years have witnessed the success of employing convex relaxations of
the AC optimal power flow (OPF) problem to find global or near-global optimal
solutions. The majority of the effort has focused on solving problem
formulations where variables live in continuous spaces. Our focus here is in
the extension of these results to the cooptimization of network topology and
the OPF problem. We employ binary variables to model topology reconfiguration
in the standard semidefinite programming (SDP) formulation of the OPF problem.
This makes the problem non-convex, not only because the variables are binary,
but also because of the presence of bilinear products between the binary and
other continuous variables. Our proposed convex relaxation to this problem
incorporates the bilinear terms in a novel way that improves over the commonly
used McCormick approximation. We also address the exponential complexity
associated with the discrete variables by partitioning the network graph in a
way tha 查看全文>>