Unit commitment by enhanced adaptive Lagrangian relaxation

By Weerakorn Ongsakul, Nit Petcharaks. IEEE Transactions on Power Systems, 2004

438 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Parallel augment Lagrangian relaxation method for transient stability constrained unit commitment (2013, neutral): “A number of different solution techniques have been proposed, such as heuristics [7], [8], dynamic programming [1], mixed-integer linear programming (MILP) [9], and Lagrangian relaxation (LR) [10], [11].”
Dynamic Economic Dispatch Using Lagrangian Relaxation With Multiplier Updates Based on a Quasi-Newton Method (2013, methodology): “From this test, it can be concluded that SGM with a constant step size is difficult to adapt to different problems, even though it is simple to implement.”
Conic relaxations of the unit commitment problem (2017, methodology): “[4] propose an enhanced adaptive LR method by defining new decision variables.”
New Local Search Methods for Improving the Lagrangian-Relaxation-Based Unit Commitment Solution (2010, methodology): “Units LRGA[8] ELR[12] MILP[7] LR LS1-first LS1-best LS2 10 518 4 - 2.”