EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
211. Solving large-scale ACOPF problems
Invited abstract in session TA-4: Topics in Mixed Integer Programming and Nonconvex Optimization, stream MINLP.
Tuesday, 8:30-10:00Room: 1001 (building: 202)
Authors (first author is the speaker)
| 1. | Matias Villagra
|
| Industrial Engineering and Operations Research, Columbia University | |
| 2. | Daniel Bienstock
|
| Columbia University |
Abstract
The ACOPF problem is a notoriously difficult nonconvex optimization problem arising in the operation of power grids. To date, all numerically effective relaxations -- that is to say, both accurate and practicable, at scale -- require second-order constraints. However, solvers have considerable difficulty tackling such constraints.
In this talk, we will describe an outer approximation linear cut scheme that yields relaxations which are both tight and can be solved quickly and robustly. Additionally, we will describe a warm-start scheme that further improves on performance. Finally, we will present a theoretical justification for, both, the success of the SOCP relaxations and their outer approximations.
Joint work with MatÃas Villagra (PhD student, Columbia University).
Keywords
- Programming, Nonlinear
- OR in Energy
- Algorithms
Status: accepted
Back to the list of papers