Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities

Sang-Bum Lee and Hanan Luss
Additional contact information
Sang-Bum Lee: Seoul City University, Seoul, Korea
Hanan Luss: AT&T Bell Laboratories, Holmdel, New Jersey

Operations Research, 1987, vol. 35, issue 2, 249-253

Abstract: We examine several variations of a capacity expansion model with multiple facility types, and with the flexibility for converting capacity from one facility type to another. Applications can be found in communication networks and production facilities. The models include costs of expansions, conversions, excess capacities and capacity shortages, and assume cost functions that are either linear or concave. We find the optimal solution by exploiting properties of extreme flows in networks and employing a dynamic programming algorithm. Specializing our results permits us to obtain different model variations by imposing certain conditions on the cost functions, and to derive the computational complexities for these variations. Typically, applications require extensive sensitivity studies that may use up substantial computer resources. Our analysis unifies previous work, extends the results, and provides intuition concerning the difficulties involved in applying the models.

Keywords: 182 multifacility capacity expansion planning; 295 applications for communications networks; 581 multilocation production models (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.2.249 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:2:p:249-253

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().