Recursive Convex Model for Optimal Power Flow Solution in Monopolar DC Networks

Oscar Danilo Montoya (), Farhad Zishan and Diego Armando Giral-Ramírez
Additional contact information
Oscar Danilo Montoya: Grupo de Compatibilidad e Interferencia Electromagnética, Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia
Farhad Zishan: Department of Electrical Engineering, Sahand University of Technology, Tabriz 5331817634, Iran
Diego Armando Giral-Ramírez: Facultad Tecnológica, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia

Mathematics, 2022, vol. 10, issue 19, 1-14

Abstract: This paper presents a new optimal power flow (OPF) formulation for monopolar DC networks using a recursive convex representation. The hyperbolic relation between the voltages and power at each constant power terminal (generator or demand) is represented as a linear constraint for the demand nodes and generators. To reach the solution for the OPF problem a recursive evaluation of the model that determines the voltage variables at the iteration t + 1 ( v t + 1 ) by using the information of the voltages at the iteration t ( v t ) is proposed. To finish the recursive solution process of the OPF problem via the convex relaxation, the difference between the voltage magnitudes in two consecutive iterations less than the predefined tolerance is considered as a stopping criterion. The numerical results in the 85-bus grid demonstrate that the proposed recursive convex model can solve the classical power flow problem in monopolar DC networks, and it also solves the OPF problem efficiently with a reduced convergence error when compared with semidefinite programming and combinatorial optimization methods. In addition, the proposed approach can deal with radial and meshed monopolar DC networks without modifications in its formulation. All the numerical implementations were in the MATLAB programming environment and the convex models were solved with the CVX and the Gurobi solver.

Keywords: recursive convex formulation; optimal power flow solution; monopolar DC networks; power losses minimization; convex optimization (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/19/3649/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/19/3649/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:19:p:3649-:d:934201

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().