Optimal Reactive Power Dispatch with Discrete Controllers Using a Branch-and-Bound Algorithm: A Semidefinite Relaxation Approach

In this paper, a methodology to solve the optimal reactive power dispatch (ORPD) in electric power systems (EPS), considering discrete controllers, is proposed. Discrete controllers, such as the tap position of on-load tap changing (OLTC) transformers and switchable reactive shunt compensation, are optimized by the proposed method. A semidefinite relaxation (SDR) of the ORPD problem and a branch-and-bound (B&B) algorithm have been fully deployed. A new formulation is presented for the OLTC transformers to obtain a connected structure of the semidefinite programming (SDP) matrices. The customized B&B algorithm deals with the discrete nature of the binary control variables. Moreover, in order to enhance the convexification, valid inequalities called lifted nonlinear cuts (NLC) are implemented in the SDR. Additionally, a chordal decomposition technique is used to improve the computational performance. Finally, the B&B algorithm is used to solve the mixed-integer semidefinite programming problem. Several benchmarks have been used to show the accuracy and scalability of the proposed method, and convergence analysis shows that near-global optimal solutions are generated with small relaxation gaps.