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

Convex inner approximation of the feeder hosting capacity limits on dispatchable demand (1905.05743v2)

Published 14 May 2019 in math.OC

Abstract: This paper presents a method to obtain a convex inner approximation that aims to improve the feasibility of optimal power flow (OPF) models in distribution feeders. For a resistive distribution network, both real and reactive power effect the node voltages and this makes it necessary to consider both when formulating the OPF problem. Inaccuracy in linearized OPF models may lead to under and over voltages when dispatching flexible demand, at scale, in response to whole-sale market or grid conditions. In order to guarantee feasibility, this paper obtains an inner convex set in which the dispatchable resources can operate, based on their real and reactive power capabilities, that guarantees network voltages to be feasible. Test simulations are conducted on a standard IEEE distribution test network to validate the approach.

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.