Open AccessPosted Content
Strengthening the SDP Relaxation of AC Power Flows with Convex Envelopes, Bound Tightening, and Lifted Nonlinear Cuts
TL;DR: In this paper, the authors considered state-of-the-art convex relaxations for the AC power flow equations and introduced new valid cuts based on convex envelopes and lifted nonlinear constraints.
read more
Abstract: This paper considers state-of-the-art convex relaxations for the AC power flow equations and introduces new valid cuts based on convex envelopes and lifted nonlinear constraints. These valid linear inequalities strengthen existing semidefinite and quadratic programming relaxations and dominate existing cuts proposed in the litterature. Together with model intersections and bound tightening, the new linear cuts close 8 of the remaining 16 open test cases in the NESTA archive for the AC Optimal Power Flow problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
A Survey of Relaxations and Approximations of the Power Flow Equations
Daniel K. Molzahn,Ian A. Hiskens +1 more
- 31 Mar 2019
TL;DR: This monograph provides the first comprehensive survey of representations in the context of optimization of the power flow equations, categorized as either relaxations or approximations.
Strengthening the SDP Relaxation of AC Power Flows With Convex Envelopes, Bound Tightening, and Valid Inequalities
TL;DR: In this paper, the authors revisited the semidefine programming (SDP) relaxation of the ac power flow equations in light of recent results illustrating the benefits of bounds propagation, valid inequalities, and the convex quadratic relaxation.
122
An Ecological Robustness Oriented Optimal Power Flow for Power Systems’ Survivability
TL;DR: In this article , an ecological robustness oriented OPF (OPF) problem was formulated to optimize power systems for reliability and survivability under unexpected contingencies, and the results showed the ecologically-inspired method is able to improve the reliability of the power systems with fewer violations and unsolved scenarios during unexpected disturbances.
8
Optimal power flow under stochastic N-1 disruptions in electric transmission grids
Haoxiang Yang,Harsha Nagarajan +1 more
TL;DR: In this paper , a multi-stage stochastic convex programming formulation was proposed to solve the multi-period optimal power flow (OPF) problem in transmission systems with a generic transmission network topology subject to N − 1 contingencies (disruptions).
•Posted Content
Robust Optimization and Control for Electricity Generation and Transmission
Chaithanya Bandi,Krishnamurthy Dvijotham,David P. Morton,Haoxiang Yang +3 more
- 19 Mar 2018
TL;DR: The theoretical results of solving a robust optimization problem for the power system under uncertainty with recourse to solve for optimal controllable injections in electricity power systems under uncertainty indicate that the robust convex relaxation of the ACOPF problem will provide a tight lower bound.
References
•Book
Power System Stability and Control
P. Kundur
- 01 Jan 1994
TL;DR: In this article, the authors present a model for the power system stability problem in modern power systems based on Synchronous Machine Theory and Modelling, and a model representation of the synchronous machine representation in stability studies.
20.5K
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
TL;DR: A comprehensive description of the primal-dual interior-point algorithm with a filter line-search method for nonlinear programming is provided, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix.
MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education
TL;DR: The details of the network modeling and problem formulations used by MATPOWER, including its extensible OPF architecture, are presented, which are used internally to implement several extensions to the standard OPF problem, including piece-wise linear cost functions, dispatchable loads, generator capability curves, and branch angle difference limits.
Semidefinite programming
Lieven Vandenberghe,Stephen Boyd +1 more
- 01 Mar 1996
TL;DR: A survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution are given.
4.4K
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
TL;DR: For nonlinear programming problems which are factorable, a computable procedure for obtaining tight underestimating convex programs is presented to exclude from consideration regions where the global minimizer cannot exist.
2.4K