Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Optimization with Neural Network Feasibility Surrogates: Formulations and Application to Security-Constrained Optimal Power Flow

Journal Article · · Energies
DOI:https://doi.org/10.3390/en16165913· OSTI ID:1994581

In many areas of constrained optimization, representing all possible constraints that give rise to an accurate feasible region can be difficult and computationally prohibitive for online use. Satisfying feasibility constraints becomes more challenging in high-dimensional, non-convex regimes which are common in engineering applications. A prominent example that is explored in the manuscript is the security-constrained optimal power flow (SCOPF) problem, which minimizes power generation costs, while enforcing system feasibility under contingency failures in the transmission network. In its full form, this problem has been modeled as a nonlinear two-stage stochastic programming problem. In this work, we propose a hybrid structure that incorporates and takes advantage of both a high-fidelity physical model and fast machine learning surrogates. Neural network (NN) models have been shown to classify highly non-linear functions and can be trained offline but require large training sets. In this work, we present how model-guided sampling can efficiently create datasets that are highly informative to a NN classifier for non-convex functions. We show how the resultant NN surrogates can be integrated into a non-linear program as smooth, continuous functions to simultaneously optimize the objective function and enforce feasibility using existing non-linear solvers. Overall, this allows us to optimize instances of the SCOPF problem with an order of magnitude CPU improvement over existing methods.

Research Organization:
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
National Science Foundation (NSF); USDOE; USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
NA0003525
OSTI ID:
1994581
Alternate ID(s):
OSTI ID: 2311428
Report Number(s):
SAND--2024-00306J; PII: en16165913
Journal Information:
Energies, Journal Name: Energies Journal Issue: 16 Vol. 16; ISSN 1996-1073; ISSN ENERGA
Publisher:
MDPI AGCopyright Statement
Country of Publication:
Switzerland
Language:
English

References (30)

Data science: Accelerating innovation and discovery in chemical engineering journal February 2016
Pyomo — Optimization Modeling in Python book January 2021
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming journal April 2005
Strong mixed-integer programming formulations for trained neural networks journal February 2020
Modeling design and control problems involving neural network surrogates journal November 2022
Deep neural networks and mixed integer linear optimization journal April 2018
Deterministic Global Optimization with Artificial Neural Networks Embedded journal October 2018
Computing feasible points for binary MINLPs with MPECs journal August 2018
Multilayer feedforward networks are universal approximators journal January 1989
MPEC problem formulations and solution strategies with chemical engineering applications journal December 2008
Adaptive sequential sampling for surrogate model generation with artificial neural networks journal September 2014
Advances in surrogate based modeling, feasibility analysis, and optimization: A review journal January 2018
State-of-the-art, challenges, and future trends in security constrained optimal power flow journal August 2011
Critical review of recent advances and further developments needed in AC optimal power flow journal July 2016
Inexact convex relaxations for AC optimal power flow: Towards AC feasibility journal October 2020
Efficient creation of datasets for data-driven power system applications journal January 2021
Solving corrective risk-based security-constrained optimal power flow with Lagrangian relaxation and Benders decomposition journal February 2016
Strong NP-hardness of AC power flows feasibility journal November 2019
Deep learning journal May 2015
A solution method of unit commitment by artificial neural networks journal January 1992
Learning Optimal Power Flow: Worst-Case Guarantees for Neural Networks conference November 2020
Identification of Umbrella Constraints in DC-Based Security-Constrained Optimal Power Flow journal November 2013
Local Solutions of the Optimal Power Flow Problem journal November 2013
Combining Deep Learning and Optimization for Preventive Security-Constrained DC Optimal Power Flow journal July 2021
A Two-Level ADMM Algorithm for AC OPF With Global Convergence Guarantees journal November 2021
Scheduling Thermostatically Controlled Loads to Provide Regulation Capacity Based on a Learning-Based Optimal Power Flow Model journal October 2021
Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints journal January 2001
Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets journal January 2022
A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF journal April 2023
A Survey of Relaxations and Approximations of the Power Flow Equations journal January 2019

Similar Records

A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints
Technical Report · Tue Nov 23 23:00:00 EST 2021 · OSTI ID:1835277

Large Scale Bilevel Optimization for N-K SCOPF Using Adversarial Robustness
Journal Article · Sun Jun 15 20:00:00 EDT 2025 · IEEE Transactions on Power Systems · OSTI ID:2569194