ABSTRACT
The second category entails conventional methods of problem-solving using mathematical programming. This category includes priority list (T. Senjyu et al. 2003), dynamic programming (P.K. Singhal et al. 2011), Lagrangian relaxation (W. Ongsakul et al. 2004), and mixed integer linear programming (A. Borghetti et al. 2008, X. Li et al. 2014). The priority list method is the simplest algorithm for unit commitment. The concept is to operate units according to the order of lowest to highest fuel cost or operation cost. This method is simple in principle and yields solutions quickly. The dynamic programming algorithm can be used for effectively solving multiple decision problems.
