On a Class of Stochastic Optimization Problems with a Specified Growth Pattern

Masao Nakamura

Management Science, 1973, vol. 20, issue 2, 236-239

Abstract: We consider a system which consists of several subsystems. The outputs of these subsystems satisfy linear difference equations which specify the growth pattern of the output of the system over time. The state of each subsystem is described by a finite Markov chain, the transition probabilities of which are subject to our control. Associated with the Markov chain of each subsystem is a cost per unit output of the subsystem, and the cost is incurred as the subsystem occupies one of J states in each epoch. The problem of minimizing the total expected cost with respect to the transition probabilities over a sufficiently long period of time is shown under certain conditions to reduce to a collection of n independent programs. Each of these can be solved by column generation techniques.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.2.236 (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:20:y:1973:i:2:p:236-239

Access Statistics for this article

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