Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case

DOI10.1023/A:1023314026477zbMath1038.90535OpenAlexW23080180MaRDI QIDQ1810824

M. E. Piñeiro Maceira, A. L. Diniz Souto Lima, Alexandre Belloni, Claudia A. Sagastizábal

Publication date: 9 June 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

Lagrangian relaxationbundle methodsaugmented Lagrangianunit commitmentfeasible dispatchpower system operation

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Theory of organizations, manpower planning in operations research (90B70)

Related Items (7)

Solving the short-term scheduling problem of hydrothermal systems via Lagrangian relaxation and augmented Lagrangian ⋮ An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem ⋮ Divide to conquer: decomposition methods for energy optimization ⋮ Large-scale unit commitment under uncertainty ⋮ Joint chance constrained programming for hydro reservoir management

Uses Software

• PLCP

This page was built for publication: Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case