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

无圈图上的二次约束二次规划及其在潮流中的应用

Quadratically constrained quadratic programs on acyclic graphs with application to power flow

Subhonmesh Bose, Dennice F. Gayme, K. Mani Chandy, Steven H. Low

摘要:

本文证明了当非凸二次约束二次规划的底层图是无圈的时,只要约束满足一定的技术条件,非凸二次约束二次规划可以在多项式时间内求解。当这个条件不满足时,我们提出了一个启发式算法来获得一个可行点。我们证明了这种方法在径向网络的最优潮流问题。

英文摘要:

This paper proves that non-convex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. When this condition is not satisfied, we propose a heuristic to obtain a feasible point. We demonstrate this approach on optimal power flow problems over radial networks.

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

↑