A Dynamic Relaxation Framework for Global Solution of ACOPF
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909650130042880 |
|---|---|
| author | Tang, Yu-Yang Chen, Liang Chen, Sheng-Jie Dai, Yu-Hong Zhou, Bo Ai, Xiaomeng |
| author_facet | Tang, Yu-Yang Chen, Liang Chen, Sheng-Jie Dai, Yu-Hong Zhou, Bo Ai, Xiaomeng |
| contents | Solving the Alternating Current Optimal Power Flow (AC OPF) problem to global optimality remains challenging due to its nonconvex quadratic constraints. In this paper, we present a unified framework that combines static piecewise relaxations with dynamic cut-generation mechanism to systematically tighten the classic Second-Order Cone Programming (SOCP) relaxation to arbitrarily small conic violation, thus enabling the recovery of globally optimal solutions. Two static formulations, Pyramidal Relaxation (PR) and Quasi-Pyramidal Relaxation (QPR), are introduced to tighten each branch-flow second-order cone via a finite union of wedges, providing controllable accuracy. Their dynamic counterparts, Dynamic PR (DPR) and Dynamic QPR (DQPR), embed on-the-fly cut generation within a branch-and-cut solver to improve scalability. Convergence is further accelerated through warm starts and a lightweight local-search post-processing. Extensive experiments on benchmarks demonstrate effective elimination of conic violations and flexible trade-offs between solution accuracy and runtime. Practical guidelines are derived for selecting appropriate variants based on network size and accuracy requirements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13402 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Dynamic Relaxation Framework for Global Solution of ACOPF Tang, Yu-Yang Chen, Liang Chen, Sheng-Jie Dai, Yu-Hong Zhou, Bo Ai, Xiaomeng Optimization and Control Solving the Alternating Current Optimal Power Flow (AC OPF) problem to global optimality remains challenging due to its nonconvex quadratic constraints. In this paper, we present a unified framework that combines static piecewise relaxations with dynamic cut-generation mechanism to systematically tighten the classic Second-Order Cone Programming (SOCP) relaxation to arbitrarily small conic violation, thus enabling the recovery of globally optimal solutions. Two static formulations, Pyramidal Relaxation (PR) and Quasi-Pyramidal Relaxation (QPR), are introduced to tighten each branch-flow second-order cone via a finite union of wedges, providing controllable accuracy. Their dynamic counterparts, Dynamic PR (DPR) and Dynamic QPR (DQPR), embed on-the-fly cut generation within a branch-and-cut solver to improve scalability. Convergence is further accelerated through warm starts and a lightweight local-search post-processing. Extensive experiments on benchmarks demonstrate effective elimination of conic violations and flexible trade-offs between solution accuracy and runtime. Practical guidelines are derived for selecting appropriate variants based on network size and accuracy requirements. |
| title | A Dynamic Relaxation Framework for Global Solution of ACOPF |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2506.13402 |