.png){kind=icon}
返回
A Novel Fast Semidefinite Programming-Based Approach for Optimal Reactive Power Dispatch
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2019.2918143.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Reactive power planning problem is the key to secure and economic operation of power systems. Optimal management of existing reactive sources leads to loss minimization and economic performance of the system. Because of the nonlinear inter-relation between the physical parameters of the electric grid, this problem is a highly nonlinear and nonconvex constrained optimization problem. The application of semidefinite programming (SDP) to power system problems has recently gained considerable research attention. A recent SDP formulation uses a convex relaxation to the nonconvex optimal power flow problem under some technical conditions. This paper proposes a novel equivalent convex optimization formulation for the optimal reactive power dispatch (ORPD) problem and presents a new framework for finding the global optimum. Numerical results for the IEEE 30-bus and 118-bus test systems show that the proposed scheme obtains the optimum operation point and outperforms various state-of-the-art methods significantly.
Keyword:
Reactive power
Optimization
Linear programming
Convex functions
Heuristic algorithms
Generators
Active power losses
convexification
optimal reactive power dispatch (ORPD)
semidefinite programming (SDP)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.9
论文数:
8.3K
被引数:
6.0W
机构
引用论文
Enhanced Multiobjective Evolutionary Algorithm Based on Decomposition for Solving the Unit Commitment Problem基于分解的改进多目标进化算法求解机组组合问题
OAAI
OAAI分享收藏
Ezh2 loss in hematopoietic stem cells predisposes mice to develop heterogeneous malignancies in an Ezh1-dependent manner.png)
BloodOAAI
BloodIF0
OAAI分享收藏分享收藏
查看更多内容