Solving profit based unit commitment problem using single unit dynamic programming

The unit commitment problem under deregulated environment involves determining the time intervals at which a particular generating unit should be online and available for generation, and the associated generation or dispatch, the aim being to maximize its total profits based on a given price profile. This dissertation describes how a lagrangian relaxation method and single unit dynamic programming algorithm is used to solve this complex optimization problem. All the usual unit constraints are considered, after which results for the chosen 26 generating units are presented, and discussed.