.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Reactive power
Optimization
Linear programming
Convex functions
Heuristic algorithms
Generators
Active power losses
convexification
optimal reactive power dispatch (ORPD)
semidefinite programming (SDP)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.9
Papers:
8.3K
Citations:
6.0W