Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
Journal Article
·
· Mathematical Programming Computation
- The Australian National University, Canberra (Australia)
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Univ. of Michigan, Ann Arbor, MI (United States)
Here, this paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimality guarantees. The new relaxations offer computational efficiency along with minimal optimality gaps, providing an interesting alternative to state-of-the-art semidefinite programming relaxations. Finally, three case studies in optimal power flow, optimal transmission switching and capacitor placement demonstrate the benefits of the new relaxations.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE; Laboratory Directed Research and Development (LDRD)
- Grant/Contract Number:
- AC52-06NA25396
- OSTI ID:
- 1469547
- Report Number(s):
- LA-UR--18-21065
- Journal Information:
- Mathematical Programming Computation, Journal Name: Mathematical Programming Computation Journal Issue: 3 Vol. 9; ISSN 1867-2949
- Publisher:
- SpringerCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
Polyhedral approximation in mixed-integer convex optimization
Convex relaxations for gas expansion planning
Journal Article
·
Mon Feb 10 23:00:00 EST 2020
· INFORMS Journal on Computing
·
OSTI ID:1688736
Polyhedral approximation in mixed-integer convex optimization
Journal Article
·
Thu Sep 14 00:00:00 EDT 2017
· Mathematical Programming
·
OSTI ID:1663183
Convex relaxations for gas expansion planning
Journal Article
·
Thu Dec 31 23:00:00 EST 2015
· INFORMS Journal on Computing
·
OSTI ID:1296664