Convex Formulation for Optimal Active and Reactive Power Dispatch

• Autor(a) principal: Viegas da Silva, Mauro
• Data de Publicação: 2022
• Outros Autores: Home Ortiz, Juan Manuel [UNESP], Pourakbari-Kasmaei, Mahdi, Sanches Mantovani, Jose Roberto [UNESP]
• Tipo de documento: Artigo
• Idioma: por
• Título da fonte: Repositório Institucional da UNESP
• Texto Completo: http://dx.doi.org/10.1109/TLA.2022.9693563; http://hdl.handle.net/11449/230350
• topic: Costs; IEEE transactions; Jacobian matrices; Load flow; Optimization; Programming; Reactive power

This paper proposes a convex programming model to solve the optimal power flow problem (OPF) related to the problems of generation active power dispatch and opportunity costs to meet the reactive power needs in energy markets. The problem is initially represented as a bilevel optimization problem where the upper level considers the minimization of opportunity costs of generating units through a second-order cone programming OPF model, and the lower level is a linear programming model that minimizes the value of active power offered by generators to the market energy. Subsequently, through the concept of strong duality, the problem is transformed into a one-level convex optimization model. Comparisons of the proposed modeling with other level formulations are presented. Results are presented for the IEEE14 and IEEE30 bus systems.