Abstract
In this paper, the large scale Unit Commitment (UC) problem has been solved using Dynamic Programming (DP) and the test results for conventional DP, Sequential DP and Truncation DP are compared with other stochastic techniques. The commitment is such that the total cost is minimal. The total cost includes both the production cost and the costs associated with start-up and shutdown of units. DP is an optimization technique which gives the optimal solution.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
