Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches

DOI10.1023/A:1013601906224zbMath1049.90043OpenAlexW1522162180MaRDI QIDQ5959911

F.-Javier Heredia, Carlos Beltran

Publication date: 11 April 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013601906224

zbMATH Keywords

auxiliary problem principleaugmented Lagrangian relaxationblock coordinate descentclassical Lagrangian relaxationunit commitmentvariable duplication

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (11)

Decomposition algorithm for large-scale two-stage unit-commitment ⋮ A comparison of four approaches from stochastic programming for large-scale unit-commitment ⋮ A classification of methods for distributed system optimization based on formulation structure ⋮ Power generation scheduling algorithm using dynamic programming ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment ⋮ The auxiliary problem principle with self-adaptive penalty parameter for multi-area economic dispatch problem ⋮ Lagrangian relaxation based algorithm for trigeneration planning with storages ⋮ An effective line search for the subgradient method ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ Large-scale unit commitment under uncertainty

Cites Work

• Auxiliary problem principle and decomposition of optimization problems
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches