Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
Gemini 2.5 Pro Pro
o3 Pro
GPT-4.1 Pro
DeepSeek R1 via Azure Pro
2000 character limit reached

Robust AC Optimal Power Flow with Robust Convex Restriction (2005.04835v4)

Published 11 May 2020 in math.OC

Abstract: Electric power grids regularly experience uncertain fluctuations from load demands and renewables, which poses a risk of violating operational limits designed to safeguard the system. In this paper, we consider the robust AC OPF problem that minimizes the generation cost while requiring a certain level of system security in the presence of uncertainty. The robust AC OPF problem requires that the system satisfy operational limits for all uncertainty realizations within a specified uncertainty set. Guaranteeing robustness is particularly challenging due to the non-convex, nonlinear AC power flow equations, which may not always have a solution. In this work, we extend a previously developed convex restriction to a robust convex restriction, which is a convex inner approximation of the non-convex feasible region of the AC OPF problem that accounts for uncertainty in the power injections. We then use the robust convex restriction in an algorithm that obtains robust solutions to AC OPF problems by solving a sequence of convex optimization problems. We demonstrate our algorithm and its ability to control robustness versus operating cost trade-offs using PGLib test cases.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.