Autoregressive processes in optimization
Keyword(s):
Vector autoregressive processes of the first order are considered which are non-negative and optimize a linear objective function. These processes may be used in stochastic linear programming with a dynamic structure. By using Tweedie's results from the theory of Markov chains, conditions for geometric rates of convergence to stationarity (i.e. so-called geometric ergodicity) and for existence and geometric convergence of moments of these processes are obtained.
2010 ◽
Vol 80
(23-24)
◽
pp. 1705-1712
◽
1999 ◽
Vol 17
(2)
◽
pp. 195-204
◽