Note--A Dynamic Programming Approach to Capacity Expansion with Specialization

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

Management Science, 1974, vol. 21, issue 3, 360-362

Abstract: The capacity expansion problem with specialization involves two classes of growing demand and two types of capacity. One type of capacity can supply both demands, while the second can supply only one. The specialization problem is an extreme case of the multilocation capacity expansion problem, and dynamic programming approaches for the multilocation problem can be adapted to solve the specialization problem.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.3.360 (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:21:y:1974:i:3:p:360-362

Access Statistics for this article

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