Solving the unit commitment problem by a unit decommitment method

DOI10.1023/A:1004653526131zbMath0958.90049MaRDI QIDQ1586810

R. Smith

Publication date: 20 November 2000

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

zbMATH Keywords

Lagrangian relaxationmixed-integer programmingunit commitmentheuristic procedurespower system schedulingunit decommitment

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

A polyhedral study of production ramping ⋮ Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach ⋮ Power generation scheduling algorithm using dynamic programming ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Large-scale unit commitment under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Solving the unit commitment problem by a unit decommitment method