arXiv Analytics

Sign in

arXiv:1810.08244 [math.OC]AbstractReferencesReviewsResources

Development of a Convex Programming Model for Optimal Power Flow Problems

Mauro Viegas da Silva, Mahdi Porakbari-Kasmaei, J. Roberto Sanches Mantovani

Published 2018-10-18Version 1

The optimal power flow (OPF) is an optimization model dedicated to the development of computational tools used for the planning and operation of electric power systems (EPS). In this work, based on the polar formulation, an extended convex model is presented. To do so, the sinusoidal and cosinusoidal terms are the toughest part of the convexification process, since such types of functions oscillate between concave and convex. These functions are not initially convex, but there is a possibility of finding a convex underestimator (CU) for them. To obtain this CU, the Taylor series presents a good, however nonconvex, approximation for such trigonometric functions. Although the model remains nonconvex, these terms can be recast to the corresponding equivalent convex terms. The obtained convex model of the OPF is tested and analyzed using the IEEE 14-, 30-, 54-, and 118-bus test systems.

Related articles: Most relevant | Search more
arXiv:1508.05037 [math.OC] (Published 2015-08-20)
Solution of Optimal Power Flow Problems using Moment Relaxations Augmented with Objective Function Penalization
arXiv:1912.09232 [math.OC] (Published 2019-12-19)
Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems
arXiv:1804.04248 [math.OC] (Published 2018-04-11)
Empirical Investigation of Non-Convexities in Optimal Power Flow Problems