Day-Ahead Coordinated Reactive Power Optimization Dispatching Based on Semidefinite Programming

  • Binbin Xu
  • , Mengqi Liu
  • , Yilin Zhong
  • , Peijie Cong
  • , Bo Zhu
  • , Tao Liu
  • , Yujun Li
  • , Zhengchun Du

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Article number5469
JournalEnergies
Volume18
Issue number20
DOIs
StatePublished - Oct 2025

Keywords

  • gaussian randomization
  • iterative method
  • reactive power optimization
  • semidefinite programming

Fingerprint

Dive into the research topics of 'Day-Ahead Coordinated Reactive Power Optimization Dispatching Based on Semidefinite Programming'. Together they form a unique fingerprint.

Cite this