Strong SOCP relaxations for the optimal power flow problem
Year of publication: |
November-December 2016
|
---|---|
Authors: | Kocuk, Burak ; Dey, Santanu S. ; Sun, X. Andy |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 64.2016, 6, p. 1177-1196
|
Subject: | optimal power flow | semidefinite programming | second order cone programming | cutting planes | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Jiang, Rujun, (2023)
-
Optimal allocation of demand response considering transmission system congestion
Neves-Motta, Vinicius, (2023)
-
On the clique decomposition impact to the optimal power flow semidefinite relaxation solve time
Ricaux, Victor, (2024)
- More ...
-
A cycle-based fomulation and valid inequalities for DC power transmission problems with switching
Kocuk, Burak, (2016)
-
Multistage adaptive robust optimization for the unit commitment problem
Lorca, Álvaro, (2016)
-
Maintenance of infinite-server service systems subjected to random shocks
Kocuk, Burak, (2013)
- More ...