
doi: 10.1137/0324075
A discrete time infinite horizon stochastic program is considered whose objective function is a sum of discounted expected costs of decisions at time t. It is supposed that a cost function is convex, the number of outcomes is finite and the decision at time t is effected only by t and the decision at time t-1. The statistical model is essentially nonstationary. The boundedness assumption on the objective function is as weak as possible. A sequence of solvable finite horizon problems is defined and the convergence of their values and decisions to the value and decision of the infinite problem is proved. The results are refined when the underlying stochastic process is a finite homogeneous Markov chain.
convergence, Markov chain, linear constraints, Stochastic programming, discrete time infinite horizon stochastic program, convex stochastic problem, sequence of solvable finite horizon problems, sum of discounted expected costs
convergence, Markov chain, linear constraints, Stochastic programming, discrete time infinite horizon stochastic program, convex stochastic problem, sequence of solvable finite horizon problems, sum of discounted expected costs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
