Accurate Linear Cutting-Plane Relaxations for ACOPF
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914951309819904 |
|---|---|
| author | Bienstock, Daniel Villagra, Matias |
| author_facet | Bienstock, Daniel Villagra, Matias |
| contents | We present a pure linear cutting-plane relaxation approach for rapidly proving tight and accurate lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF) and its multi-period extension with ramping constraints. Our method leverages outer-envelope linear cuts for well-known second-order cone relaxations for ACOPF together with modern cut management techniques and reformulations to attain numerical stability. These techniques prove effective on a broad family of ACOPF instances, including the largest ones publicly available, quickly and robustly yielding tight bounds. Additionally, we consider the (frequent) case where an ACOPF instance is handled following a small or moderate change in problem data, e.g., load changes and generator or branch shut-offs. We provide significant computational evidence, on single and multi-period ACOPF instances, that the cuts computed on the prior instance provide very good lower bounds when warm-starting our algorithm on the perturbed instance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_04251 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Accurate Linear Cutting-Plane Relaxations for ACOPF Bienstock, Daniel Villagra, Matias Optimization and Control We present a pure linear cutting-plane relaxation approach for rapidly proving tight and accurate lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF) and its multi-period extension with ramping constraints. Our method leverages outer-envelope linear cuts for well-known second-order cone relaxations for ACOPF together with modern cut management techniques and reformulations to attain numerical stability. These techniques prove effective on a broad family of ACOPF instances, including the largest ones publicly available, quickly and robustly yielding tight bounds. Additionally, we consider the (frequent) case where an ACOPF instance is handled following a small or moderate change in problem data, e.g., load changes and generator or branch shut-offs. We provide significant computational evidence, on single and multi-period ACOPF instances, that the cuts computed on the prior instance provide very good lower bounds when warm-starting our algorithm on the perturbed instance. |
| title | Accurate Linear Cutting-Plane Relaxations for ACOPF |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2312.04251 |