Papers › Optimization-Based Exploration of the Feasible Power Flow Space for Rapid Data Collection
Optimization-Based Exploration of the Feasible Power Flow Space for Rapid Data Collection
Ignasi Ventura Nadal, Samuel Chevalier
This paper provides a systematic investigation into the various nonlinear objective functions which can be used to explore the feasible space associated with the optimal power flow problem. A total of 40 nonlinear objective functions are tested, and their results are compared to the data generated by a novel exhaustive rejection sampling routine. The Hausdorff distance, which is a min-max set dissimilarity metric, is then used to assess how well each nonlinear objective function performed (i.e., how well the tested objective functions were able to explore the non-convex power flow space). Exhaustive test results were collected from five PGLib test-cases and systematically analyzed.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections