.png){kind=icon}
返回
Optimal Power Flow as a Polynomial Optimization Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2015.2390037.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic convergence in theory. We formulate the ACOPF as a degree-two polynomial program and study two approaches to solving it via convexifications. In the first approach, we tighten the first-order relaxation of the nonconvex quadratic program by adding valid inequalities. In the second approach, we exploit the structure of the polynomial program by using a sparse variant of Lasserre's hierarchy. This allows us to solve instances of up to 39 buses to global optimality and to provide strong bounds for the Polish network within an hour.
Keyword:
Mathematical programming
method of moments
numerical analysis
optimization
power system management
sparse matrices
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容