Discrete Shortest Paths i
Discrete Shortest Paths in Optimal Power Flow Feasible Regions
Discrete Shortest Paths in Optimal Power Flow Feasible Regions
arXiv:2408.02172v2 Announce Type: replace-cross
Abstract: Optimal power flow (OPF) is a critical optimization problem for power systems to operate at points where cost or other operational objectives are optimized. Due to the non-convexity of the set of feasible OPF operating points, it is non-triv…