Towards a more rigorous and practical unit commitment by Lagrangian relaxation
Fulin Zhuang, Francisco D. Galiana · IEEE Transactions on Power Systems · 1988
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.>
Cited by 453 works. doi:10.1109/59.192933
Authors
References
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A New Method for Unit Commitment at Electricite De France
- Evaluation of Dynamic Programming Based Methods and Multiple area Representation for Thermal Unit Commitments
- Nonlinear programming: Theory and algorithms
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- Solution of Large-Scale Optimal Unit Commitment Problems
- A Method for Solving the Fuel Constrained Unit Commitment Problem
- A Survey of Lagrangean Techniques for Discrete Optimization
- Lagrangian Reduction of Search-Range for Large-Scale Unit Commitment