Open AccessLinear inequalities convex transformation for optimal reactive power flow model based on MISOCP relaxations
Author(s) -
Lin Chunmei,
Wei Hua,
Hou Wenting,
Tan Jiancheng
Publication year - 2018
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2017.1714
Subject(s) - mathematics , mathematical optimization , convex optimization , linear matrix inequality , second order cone programming , ac power , regular polygon , linear programming , transformer , relaxation (psychology) , convex cone , convex analysis , power (physics) , voltage , engineering , psychology , social psychology , electrical engineering , physics , geometry , quantum mechanics
A convex optimisation model for global optimum solution of optimal reactive power flow (ORPF) problem is proposed in this study, to solve the challenge of discrete variables of transformer taps involved in traditional ORPF models. Based on the second‐order cone programming relaxation, a set of inequalities with 0–1 variables are introduced, to convexify the non‐convex items that are products of discrete variables (or squares of discrete variables) and linear functions. After convexification, items containing second order of transformer ratio variables are dropped to the first order, and the non‐convex non‐linear nodal power equalities are equivalently transformed into linear equalities, thus formulating a mix‐integer second‐order cone programming (MISOCP) model of ORPF problem over feasible convex domain, which guarantees the global optimum theoretically. The results of IEEE‐14, 30, 57, 118 bus systems show that, with stable numerical property and good optimum effect, the proposed model can give consideration to not only the quality of solution, but also the efficiency of calculation.