This research is of a sequencing expansion problem in which capacity can be added only atrndiscrete points in time. There is a forecast of demand in each period, and five expansionrnprojects each with a given capacity and cost.rnDynamic programming is used to determine the sequence of expansions necessary to providernsufficient capacity to meet the demand in all periods at minimum discounted cost. Thernalternative scenarios are represented with a tree structure.rnThis research also provides preliminary results for a discounted cash flow as well as arndynamic programming solution.rnKEYWORDS: Capacity expansion, dynamic programming, sensitivity analysis