Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.16496 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912892359540736 |
|---|---|
| author | Pineda, Salvador Morales, Juan Miguel |
| author_facet | Pineda, Salvador Morales, Juan Miguel |
| contents | Topology optimization has emerged as a powerful and increasingly relevant strategy for enhancing the flexibility and efficiency of power system operations. However, solving these problems is computationally demanding due to their combinatorial nature and the use of big-M formulations. Optimization-based bound tightening (OBBT) is a well-known strategy to improve the solution of mixed-integer linear programs (MILPs) by computing tighter bounds for continuous variables. Yet, existing OBBT approaches in topology optimization typically relax all switching decisions in the bounding subproblems, leading to excessively loose feasible regions and limited bound improvements. In this work, we propose a topology-aware bound tightening method that uses network structure to determine which switching variables to relax. Through extensive computational experiments on the IEEE 118-bus system, we find that keeping a small subset of switching variables as binary, while relaxing the rest, strikes a sweet spot between the computational effort required to solve the bounding problems and the tightness of the resulting bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_16496 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Sweet Spot of Bound Tightening for Topology Optimization Pineda, Salvador Morales, Juan Miguel Optimization and Control Topology optimization has emerged as a powerful and increasingly relevant strategy for enhancing the flexibility and efficiency of power system operations. However, solving these problems is computationally demanding due to their combinatorial nature and the use of big-M formulations. Optimization-based bound tightening (OBBT) is a well-known strategy to improve the solution of mixed-integer linear programs (MILPs) by computing tighter bounds for continuous variables. Yet, existing OBBT approaches in topology optimization typically relax all switching decisions in the bounding subproblems, leading to excessively loose feasible regions and limited bound improvements. In this work, we propose a topology-aware bound tightening method that uses network structure to determine which switching variables to relax. Through extensive computational experiments on the IEEE 118-bus system, we find that keeping a small subset of switching variables as binary, while relaxing the rest, strikes a sweet spot between the computational effort required to solve the bounding problems and the tightness of the resulting bounds. |
| title | The Sweet Spot of Bound Tightening for Topology Optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2507.16496 |