Convex Relaxations in Power System Optimization: Towards Robust AC OPF (extra)
1.7 هزار بار بازدید -
6 سال پیش
-
Convex relaxations of the AC
Convex relaxations of the AC power flow equations have attracted significant interest in the power systems research community in recent years. This collection of videos provides a brief introduction to the mathematics of AC power systems, continuous nonlinear optimization, and relaxations of the power flow equations.
This lecture demonstrates how convex relaxations can be utilized to guarantee robust constraint feasibility for a stochastic variant of the AC Optimal PowerFlow problem, as presented in the reference below. The method uses convex relaxations to provide conservative bounds on the impact of uncertainty. To avoid overly conservative results, a combination of multiple convex relaxations and bound tightening is utilized.
A citable abstract of this lecture series is available here: https://arxiv.org/abs/1807.07227
References in the video:
https://molzahn.github.io/pubs/molzah...
LA-UR-18-26156
This lecture demonstrates how convex relaxations can be utilized to guarantee robust constraint feasibility for a stochastic variant of the AC Optimal PowerFlow problem, as presented in the reference below. The method uses convex relaxations to provide conservative bounds on the impact of uncertainty. To avoid overly conservative results, a combination of multiple convex relaxations and bound tightening is utilized.
A citable abstract of this lecture series is available here: https://arxiv.org/abs/1807.07227
References in the video:
https://molzahn.github.io/pubs/molzah...
LA-UR-18-26156
6 سال پیش
در تاریخ 1397/04/20 منتشر شده
است.
1,794
بـار بازدید شده