Security-constrained unit commitment: a decomposition approach embodying Kron reduction

DOI10.1016/J.EJOR.2023.06.013MaRDI QIDQ6982590zbMATH OpenFDO

Authors Gonzalo E. Constante-Flores, Antonio J. Conejo

Publication date 19 May 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.06.013

zbMATH Keywords

decomposition algorithmlarge scale optimizationnetwork reductionOR in energyunit commitment

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Cites work

• Accelerating the Benders decomposition method: application to stochastic network design problems
• Decision making under uncertainty in electricity markets
• scientific article; zbMATH DE number 3035866 (Why is no real title available?)
• Introduction to stochastic programming.
• JuMP: a modeling language for mathematical optimization
• Kron Reduction of Graphs With Applications to Electrical Networks

Cited in

(2)

• An adaptive hybrid algorithm with system participants classification for efficient convex hull pricing in electricity markets
• Bundle-enhanced column-and-constraint generation method for solving two-stage robust optimization problems

This page was built for publication: Security-constrained unit commitment: a decomposition approach embodying Kron reduction

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