.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Alternating direction method of multipliers
Benders decomposition
branch-and-bound
Lagrangian duality
security-constrained optimal power flow
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W