Convex inner approximation of the feeder hosting capacity limits on\n dispatchable demand

2019/05/14 by Nawaf Nazir, Nazir, Nawaf, Mads Almassalkhi +1 · 1 citation
Engineering · #FOS: Mathematics #Microgrid Control and Optimization #Optimal Power Flow Distribution #Optimization and Control (math.OC) #Smart Grid Energy Management

paper · pdf · doi:10.48550/arxiv.1905.05743

openalex publication_date 2019/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Cited by

• Identifying the Smallest Adversarial Load Perturbation that Renders DC-OPF Infeasible

Related

• Decomposed Phase Analysis using Convex Inner Approximations: a Methodology for DER Hosting Capacity in Distribution Systems
• A Linearized Power Flow Model for Optimization in Unbalanced Distribution Systems
• Exact Distribution Optimal Power Flow (D-OPF)Model using Convex\n Iteration Technique
• Grid-aware aggregation and realtime disaggregation of distributed energy\n resources in radial networks
• Second-Order Cone Relaxations of the Optimal Power Flow for Active Distribution Grids