Solving the unit commitment problem by a unit decommitment method
From MaRDI portal
Recommendations
- Solution to short-term unit commitment problem
- scientific article; zbMATH DE number 1264433
- Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm
- A deterministic method for the unit commitment problem in power systems
- A comparative study of three different mathematical methods for solving the unit commitment problem
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- An O(n) algorithm for quadratic knapsack problems
- Optimal scheduling of thermal generating units
- Optimal short-term scheduling of large-scale power systems
- Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
Cited in
(8)- Large-scale unit commitment under uncertainty: an updated literature survey
- Power generation scheduling algorithm using dynamic programming
- An improved unit decommitment algorithm for combined heat and power systems
- Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
- A polyhedral study of production ramping
- Large-scale unit commitment under uncertainty
- A deterministic method for the unit commitment problem in power systems
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants
This page was built for publication: Solving the unit commitment problem by a unit decommitment method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586810)
