|
|
|
(3.140.198.12)
|
|
Users online: 16168
|
|
|
|
|
|
|
Ijournet
|
|
|
|
|
|
|
Solving profit based unit commitment problem using single unit dynamic programming Krishna P.V. Rama1, Dr. Sao Sukhdeo2 1Assistant professor, Gitam University, Hyderabad 2Professor, B.I.E.T, Hyderabad Online published on 26 June, 2013. Abstract 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. Top Keywords unit commitment, deregulation, dynamic programming, mat lab. Top | |
|
|
|
|
║ Site map
║
Privacy Policy ║ Copyright ║ Terms & Conditions ║
|
|
|
751,042,112 visitor(s) since 30th May, 2005.
|
|
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
|
|
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.
|