Résolution exacte du problème de l'optimisation des flux de puissance

Abstract : Alternative Current Optimal Power Flow (ACOPF) is naturally formulated as a non-convex problem. In that context, solving (ACOPF) to global optimality remains a challenge when classic convex relaxations are not exact. We use semidefinite programming to build a quadratic convex relaxation of (ACOPF). We show that this quadratic convex relaxation has the same optimal value as the classical semidefinite relaxation of (ACOPF) which is known to be tight. In that context, we build a spatial branch-and-bound algorithm to solve (ACOPF) to global optimality that is based on a quadratic convex programming bound.
Complete list of metadatas

Cited literature [68 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02463203
Contributor : Abes Star <>
Submitted on : Thursday, January 23, 2020 - 10:43:07 AM
Last modification on : Friday, February 21, 2020 - 10:55:46 AM

File

TheseGODARD.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02463203, version 2

Collections

Citation

Hadrien Godard. Résolution exacte du problème de l'optimisation des flux de puissance. Optimisation et contrôle [math.OC]. Conservatoire national des arts et metiers - CNAM, 2019. Français. ⟨NNT : 2019CNAM1258⟩. ⟨tel-02463203v2⟩

Share

Metrics

Record views

84

Files downloads

33