Optimal Power Flow Solution for Bipolar DC Networks Using a Recursive Quadratic Approximation
Oscar Danilo Montoya, Walter Gil-González, Jesús C. Hernández
Abstract
The problem regarding of optimal power flow in bipolar DC networks is addressed in this paper from the recursive programming stand of view. A hyperbolic relationship between constant power terminals and voltage profiles is used to resolve the optimal power flow in bipolar DC networks. The proposed approximation is based on the Taylors’ Taylor series expansion. In addition, nonlinear relationships between dispersed generators and voltage profiles are relaxed based on the small voltage voltage-magnitude variations in contrast with power output. The resulting optimization model transforms the exact nonlinear non-convex formulation into a quadratic convex approximation. The main advantage of the quadratic convex reformulation lies in finding the optimum global via recursive programming, which adjusts the point until the desired convergence is reached. Two test feeders composed of 21 and 33 buses are employed for all the numerical validations. The effectiveness of the proposed recursive convex model is verified through the implementation of different metaheuristic algorithms. All the simulations are carried out in the MATLAB programming environment using the convex disciplined tool known as CVX with the SEDUMI and SDPT3 solvers.