Using mixed-integer programming to solve power grid blackout problems

DOI10.1016/j.disopt.2006.10.007zbMath1173.90335OpenAlexW2163228636MaRDI QIDQ2471280

Sara Mattia, Bienstock, Daniel

Publication date: 22 February 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.007

zbMATH Keywords

mixed-integer programmingpower flowsblackouts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items

Survivable network design with shared-protection routing ⋮ Interdependent network restoration: on the value of information-sharing ⋮ Energy-aware survivable networks ⋮ Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption ⋮ Cardinality of Upper Average and Its Application to Network Optimization ⋮ A Linear-Programming Approximation of AC Power Flows ⋮ Convex quadratic relaxations for mixed-integer nonlinear programs in power systems ⋮ Quantitative Models for Infrastructure Restoration After Extreme Events: Network Optimization Meets Scheduling ⋮ Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem ⋮ Global optimization of multilevel electricity market models including network design and graph partitioning ⋮ A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching ⋮ Benders Decomposition for Capacitated Network Design ⋮ Bi-objective optimization models for network interdiction ⋮ Transmission system repair and restoration

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Minimum cost capacity installation for multicommodity network flows
• Mathematical study of very high voltage power networks. III: The optimal AC power flow problem
• Mathematical Study of Very High Voltage Power Networks II: The AC Power Flow Problem
• Mathematical Study of Very High Voltage Power Networks I: The Optimal DC Power Flow Problem
• A LOADING-DEPENDENT MODEL OF PROBABILISTIC CASCADING FAILURE
• Network Design Using Cut Inequalities
• Über ein Paradoxon aus der Verkehrsplanung
• Integer Programming and Combinatorial Optimization