Capacity Planning for Large Multilocation Systems: Approximate and Incomplete Dynamic Programming Approaches

Donald Erlenkotter
Additional contact information
Donald Erlenkotter: University of California, Los Angeles

Management Science, 1975, vol. 22, issue 3, 274-285

Abstract: Methods for planning capacity expansion typically have been restricted to problems with many locations in a static environment or a few locations in a dynamic environment. Two approaches are developed here for dynamic capacity planning problems with many locations. The first is an approximate approach based on an equivalent annual cost measure, and the second is a procedure for systematic improvement of the approximate solution. The method for improvement is called "incomplete dynamic programming" since it consists of an approximation to the first cycle of the dynamic programming policy iteration approach. Computational results are reported for tests of the methods against dynamic programming solutions for small problems. Applications are made to two versions of a large-scale problem of planning capacity expansion for India's nitrogenous fertilizer industry, and results are compared with those for other approaches.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.3.274 (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:ormnsc:v:22:y:1975:i:3:p:274-285

Access Statistics for this article

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