Capacity expansion problems can be formulated by a mixed integer programming. It has the objective of minimizing total discounted costs for meeting demands specified in different time periods at various demand locations. Costs include those for operation