An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems
- Northwestern Univ., Evanston, IL (United States); Northwestern University
We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.
- Research Organization:
- Northwestern University
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AR0001077
- OSTI ID:
- 2404586
- Report Number(s):
- DOE-Northwestern-1077
- Country of Publication:
- United States
- Language:
- English
Similar Records
LP and NLP decomposition without a master problem
Solving security constrained optimal power flow problems by a structure exploiting interior point method