A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid

DOI10.1287/ijoc.2022.1178OpenAlexW3157514916MaRDI QIDQ5106423

Emma S. Johnson, Santanu S. Dey

Publication date: 19 September 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.02801

zbMATH Keywords

mixed integer programmingbilevel programminginterdiction

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• Gurobi
• Pyomo
• PGLib-OPF

Cites Work

• A trilevel programming approach for electric grid defense planning
• A survey of network interdiction models and algorithms
• A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
• The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
• Hardness and approximation for network flow interdiction
• Shortest-path network interdiction
• Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
• Pyomo -- optimization modeling in Python

This page was built for publication: A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid