.png){kind=icon}
.png){kind=icon}
Return
Day-Ahead Coordinated Reactive Power Optimization Dispatching Based on Semidefinite Programming
.png){kind=icon}
OA
AI
DOI：10.3390/en18205469.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With access to new energy sources, the problem of reactive power optimization and dispatching has become increasingly important for research. However, the reactive power optimization problem is a mixed integer nonlinear optimization problem. In order to solve the integer variables and nonlinear conditions existing therein, a method for coordinated reactive power optimization and dispatching based on semidefinite programming is proposed. Firstly, a reactive power optimization model considering discrete variables and continuous variables is established with the minimization of total operating cost as the objective function; secondly, the discrete variables are transformed into equality constraints by quadratic equations, and then a solvable semi-definite programming problem is obtained; thirdly, the rank-one constraint is restored by the Iterative Optimization based Gaussian Randomization Method (IOGRM), and the optimal solution equivalent to the original problem is obtained. Finally, the correctness and effectiveness of the proposed model and solution method are verified by analyzing and comparing with the second-order cone programming (SOCP) through the modified IEEE standard example.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
View more organizations