4.7 Article

Computing the Feasible Spaces of Optimal Power Flow Problems

Journal

IEEE TRANSACTIONS ON POWER SYSTEMS
Volume 32, Issue 6, Pages 4752-4763

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2017.2682058

Keywords

Convex optimization; feasible space; global solution; optimal power flow (OPF)

Funding

  1. Advanced Research Projects Agency-Energy (ARPA-E), U.S. Department of Energy [DE-AC02-06CH11357]

Ask authors/readers for more resources

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem's feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem's inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation algorithm. To improve computational tractability, bound tightening and grid pruning algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. The proposed algorithm is used to generate the feasible spaces of two small test cases.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available