DOE OSTI · 1835277
A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints
Abstract
This project aimed to develop a scalable algorithm for security-constrained optimal power flow (SCOPF) under contingency scenarios. In particular, the SCOPF problem targeted in the GO Competition is challenging because of the nonconvexity, its nonsmoothness, and the problem size, which increases with the number of contingency events. Complementarity constraints imposed in post-contingency variables are particularly challenging because they lead to a violation of constraint qualifications at any feasible point.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kim, Kibaek, Kim, Youngdae, Maldonado, Daniel A., Schanen, Michel, Zavala, Victor M., Chiang, Nai-Yuan. 2021-11-24. A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints. https://doi.org/10.2172/1835277
Cite the original work for its findings. Save a collection to share your selection of sources.