UNIT Committment solution using Dynamic programming [Deleted]

INTRODUCTION

The unit commitment is an optimization problem that economically schedules generating units over a short-term planning horizon subject to the satisfaction of demand and other system operating constraints. Many optimization methods have been proposed to solve the unit commitment problem. These methods include priority list methods, dynamic programming methods, sequential method and Lawgrangian relaxation methods etc. Lagrangian relaxation methods are now among the most widely...

Click to expand...