“21st PSCC 2020 papers submission and review platform

Full Program »

Proving Global Optimality of ACOPF Solutions

View File
PDF
0.3MB

We present our latest contributions in terms of mathematical modeling and algorithm development for the global optimization of the ACOPF problem. These contributions allow us to close the optimality gap on a number of open instances in the PGLIB and NESTA benchmark libraries. This is achieved by combining valid cut generation with semidefinite programmingbased bound tightening. The mathematical formulations along with the solution algorithms are implemented in the modeling framework Gravity (www.gravityopt.com), an open-source platform for reproducible numerical experiments.

Author(s):

Smitha Gopinath    
Los Alamos National Laboratory
United States

Hassan Hijazi    
Los Alamos National Laboratory
United States

Tillmann Weisser    
Los Alamos National Laboratory
United States

Harsha Nagarajan    
Los Alamos National Laboratory
United States

Mertcan Yetkin    
Lehigh University
United States

Kaarthik Sundar    
Los Alamos National Laboratory
United States

Russell Bent    
Los Alamos National Laboratory
United States

 

Powered by OpenConf®
Copyright ©2002-2014 Zakon Group LLC