A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems

DOI10.1137/19M127611XMaRDI QIDQ5853569zbMATH OpenOpenAlexFDO

Authors Brian Dandurand, Sven Leyffer, Kibaek Kim

Publication date 10 March 2021

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/19m127611x

zbMATH Keywords

network contingency identificationnonconvex robust optimizationnonlinear mixed-integer programmingoptimal power flow

Mathematics Subject Classification ID

Mixed integer programming (90C11) Robustness in mathematical programming (90C17) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
• A trilevel programming approach for electric grid defense planning
• AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
• An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems

Cites work

• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• A trilevel programming approach for electric grid defense planning
• Analysis of Failures in Power Grids
• Basic theoretical foundations and insights on bilevel models and their applications to power systems
• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Branching rules revisited
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• Contingency-constrained unit commitment with post-contingency corrective recourse
• Convex Analysis
• Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
• Convex Relaxation of Optimal Power Flow—Part II: Exactness
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Julia: a fresh approach to numerical computing
• JuMP: a modeling language for mathematical optimization
• Nonlinear optimization.
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
• Strong NP-hardness of AC power flows feasibility
• The N-k problem in power grids: new models, formulations, and numerical experiments

Cited in

(3)

• An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems
• A trilevel programming approach for electric grid defense planning
• An exact method for nonlinear network flow interdiction problems

Describes a project that uses

Uses Software

• Gurobi
• HSL
• CPLEX
• Ipopt
• MATPOWER
• Julia
• pstca
• GNU parallel
• PowerModels.jl
• MaximinOPF.jl
• JuMP
• GitHub

This page was built for publication: A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853569)