Optimization of Hydropower Plant Expansion Case Study: Nile Basin, Ethiopia
No Thumbnail Available
Date
2008-06
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
This research is of a sequencing expansion problem in which capacity can be added only at
discrete points in time. There is a forecast of demand in each period, and five expansion
projects each with a given capacity and cost.
Dynamic programming is used to determine the sequence of expansions necessary to provide
sufficient capacity to meet the demand in all periods at minimum discounted cost. The
alternative scenarios are represented with a tree structure.
This research also provides preliminary results for a discounted cash flow as well as a
dynamic programming solution.