.png){kind=icon}
返回
Some Efficient Optimization Methods for Solving the Security-Constrained Optimal Power Flow Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2013.2283175.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The security-constrained optimal power flow problem considers both the normal state and contingency constraints, and it is formulated as a large-scale nonconvex optimization problem. We propose a global optimization algorithm based on Lagrangian duality to solve the nonconvex problem to optimality. As usual, the global approach is often time-consuming, thus, for practical uses when dealing with a large number of contingencies, we investigate two decomposition algorithms based on Benders cut and the alternating direction method of multipliers. These decomposition schemes often generate solutions with a smaller objective function values than those generated by the conventional approach and very close to the globally optimal points.
Keyword:
Alternating direction method of multipliers
Benders decomposition
branch-and-bound
Lagrangian duality
security-constrained optimal power flow
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容