Skip to Main content Skip to Navigation
Conference papers

Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization

Abstract : Optimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality. To this end, we specialize the Mixed-Integer Quadratic Convex Reformulation method (MIQCR) to (OPF). This is a method in two steps. First, a Semi-Definite Programming (SDP) relaxation of (OPF) is solved. Then the optimal dual variables of this relaxation are used to reformulate OPF into an equivalent new quadratic program, where all the non-convexity is moved to one additional constraint. In the second step, this reformulation is solved within a branch-and-bound algorithm, where at each node a quadratic and convex relaxation of the reformulated problem, obtained by relaxing the non-convex added constraint, is solved. The key point of our approach is that the lower bound at the root node of the branch-and-bound tree is equal to the SDP relaxation value. We test this method on several OPF cases, from two-bus networks to more-than-a-thousand-buses networks from the MAT-POWER repository. Our first results are very encouraging.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
Contributor : Hadrien Godard <>
Submitted on : Tuesday, March 19, 2019 - 9:23:43 AM
Last modification on : Thursday, February 18, 2021 - 2:51:36 PM
Long-term archiving on: : Thursday, June 20, 2019 - 12:51:18 PM


Novel _Approach_Towards_Global...
Files produced by the author(s)



Hadrien Godard, Sourour Elloumi, Amélie Lambert, Jean Maeght, Manuel Ruiz. Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. 6th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2019, Paris, France. ⟨10.1109/CoDIT.2019.8820584⟩. ⟨hal-02065034v2⟩



Record views


Files downloads