On dynamic programming recursions for multiplicative Markov decision chains

Dynamic programming recursions for multiplicative Markov decision chains are discussed in the paper. Attention is focused on their asymptotic behavior as well as to practical ways of computing an optimal policy. Under certain additional assumptions it is possible to extend the obtained results to the denumerable state space.