Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 48448 (Why is no real title available?)
- scientific article; zbMATH DE number 486633 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Auxiliary problem principle and decomposition of optimization problems
Cited in
(13)- An effective line search for the subgradient method
- 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
- Decomposition algorithm for large-scale two-stage unit-commitment
- The auxiliary problem principle with self-adaptive penalty parameter for multi-area economic dispatch problem
- Power generation scheduling algorithm using dynamic programming
- scientific article; zbMATH DE number 62349 (Why is no real title available?)
- A comparison of four approaches from stochastic programming for large-scale unit-commitment
- Large-scale unit commitment under uncertainty
- A comparative study of three different mathematical methods for solving the unit commitment problem
- Lagrangian relaxation of the generic materials and operations planning model
- Lagrangian relaxation based algorithm for trigeneration planning with storages
- A classification of methods for distributed system optimization based on formulation structure
This page was built for publication: Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959911)
