Solving the unit commitment problem by a unit decommitment method
From MaRDI portal
Publication:1586810
DOI10.1023/A:1004653526131zbMath0958.90049MaRDI QIDQ1586810
Publication date: 20 November 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Lagrangian relaxation; mixed-integer programming; unit commitment; heuristic procedures; power system scheduling; unit decommitment
90C11: Mixed integer programming
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A polyhedral study of production ramping, Power generation scheduling algorithm using dynamic programming, Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach, Large-scale unit commitment under uncertainty: an updated literature survey, Large-scale unit commitment under uncertainty
Cites Work
- An O(n) algorithm for quadratic knapsack problems
- Optimal short-term scheduling of large-scale power systems
- Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- Optimal scheduling of thermal generating units
- Unnamed Item
- Unnamed Item