Connection between stochastic control of Markov process parameter and transportation problem |

G. Sh. Tsitsiashvili |

2002, issue 2, Ñ. 216–226 |

Abstract |

Consider a functioning of discrete Markov process in random environment. That is the process behavior is defined by some randomly varying parameter. Suppose that stationary distributions of the process under fixed meanings of the parameter are known. A problem is to choose a control of parameter ramdom variation so that the stationary distribution of obtained process equals to probability mixture of stationary distributions of this process under fixed parameter meanings. An algorytm which put a mutually synonymous accordance between a set of all stochastic controls and a set of all accessible solutions of some transportation problem and an interior of some multidimensional cube is constructed. |

Keywords: |

Download the article (PDF-file) |

## References |

[1] F. P. Kelly, Reversibility and Stochastic Networks, John Wiley and Sons, 1979. [2] Y. Zhu, Markovian Queueing Networks in Random Environment, Operations Research Letters, 15 (1994), 11–17. [3] D. Baum and G. Sh. Tsitsiashvili, On Product Connection Theorems for Markov Chains, International Journal on Pure and Applied Mathematics, 1:2 (2002), 167–197. [4] G. Sh. Ciciashvili, M. A. Osipova, Stoxasticheskoe upravlenie parametrom diskretnogo markovskogo processa, Dal'nevost. matem. zhurn., 3:1 (2002), 58–60. [5] R. Gabasov, F. M. Kirillova, Metody linejnogo programmirovaniya, t. 2, izd-vo BGU, Minsk, 1978, 239 s. |