Towards a more rigorous and practical unit commitment by Lagrangian relaxation
- 1 May 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 3 (2) , 763-773
- https://doi.org/10.1109/59.192933
Abstract
A Lagrangian relaxation algorithm for power system generator unit commitment is proposed. The algorithm proceeds in three phases. In the first phase, the Lagrangian dual of the unit commitment is maximized by standard subgradient techniques. The second phase finds a reserve-feasible dual solution, followed by a third phase of economic dispatch. A mathematically based, systematic and generally applicable procedure to search for a reserve-feasible dual solution is presented. The algorithm has been tested on systems of up to 100 units to be scheduled over 168 hours, giving reliable performance and low execution times. Both spinning and time-limited reserve constraints are treated.Keywords
This publication has 8 references indexed in Scilit:
- A New Method for Unit Commitment at Electricite De FranceIEEE Transactions on Power Apparatus and Systems, 1983
- Solution of Large-Scale Optimal Unit Commitment ProblemsIEEE Transactions on Power Apparatus and Systems, 1982
- Optimal short-term scheduling of large-scale power systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit CommitmentsIEEE Transactions on Power Apparatus and Systems, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- A Survey of Lagrangean Techniques for Discrete OptimizationAnnals of Discrete Mathematics, 1979
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation SystemsOperations Research, 1977
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963