arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.04557math.OC
收藏

利用半定松弛和局部解快速确定OPF问题最优目标值的方法

A Method for Quickly Bounding the Optimal Objective Value of an OPF Problem using a Semidefinite Relaxation and a Local Solution

Alireza Barzegar, Daniel K. Molzahn, Rong Su

摘要:

最优潮流是电力系统运行中的一个重要问题。由于最优潮流问题的非凸性,可能存在多个局部最优解。证明获得整体解对于OPF问题的某些应用是重要的。许多全局优化技术计算最优性间隙,该最优性间隙将对应于来自局部解算法的可行点的可实现目标值与来自凸松弛技术的目标值界限进行比较。而不是传统的做法,完全分离的局部解和凸松弛计算,本文提出了一种方法,利用局部解的信息,使用半定规划(SDP)松弛的目标值界的计算速度。计算易处理性的改善伴随着所得客观值界的紧密性降低的权衡。数值实验说明了这种权衡,与所提出的方法是更快,但比SDP松弛和更慢,但更紧比二阶锥规划(SOCP)和二次凸(QC)松弛许多大型测试用例。

英文摘要:

Optimal power flow (OPF) is an important problem in the operation of electric power systems. Due to the OPF problem's non-convexity, there may exist multiple local optima. Certifiably obtaining the global solution is important for certain applications of OPF problems. Many global optimization techniques compute an optimality gap that compares the achievable objective value corresponding to the feasible point from a local solution algorithm with the objective value bound from a convex relaxation technique. Rather than the traditional practice of completely separating the local solution and convex relaxation computations, this paper proposes a method that exploits information from a local solution to speed the computation of an objective value bound using a semidefinite programming (SDP) relaxation. The improvement in computational tractability comes with the trade-off of reduced tightness for the resulting objective value bound. Numerical experiments illustrate this trade-off, with the proposed method being faster but weaker than the SDP relaxation and slower but tighter than second-order cone programming (SOCP) and quadratic convex (QC) relaxations for many large test cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑