Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Sladký, Karel. On the set of optimal controls for Markov chains with rewards. Kybernetika, Tome 10 (1974) no. 4, pp. 350-367. http://geodesic.mathdoc.fr/item/KYB_1974_10_4_a3/
@article{KYB_1974_10_4_a3,
author = {Sladk\'y, Karel},
title = {On the set of optimal controls for {Markov} chains with rewards},
journal = {Kybernetika},
pages = {350--367},
year = {1974},
volume = {10},
number = {4},
mrnumber = {0378842},
zbl = {0299.49009},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1974_10_4_a3/}
}
[1] Blackwell D.: Discrete Dynamic Programming. Annals Mathem. Statistics 33 (1962), 2, 719-726. | MR | Zbl
[2] Denardo E. V., Miller B. L.: An Optimality Condition for Discrete Dynamic Programming with No Discounting. Annals Mathem. Statistics 39 (1968), 4, 1220-1227. | MR | Zbl
[3] Lippman S. A.: On the Set of Optimal Policies in Discrete Dynamic Programming. Journal Mathem. Analysis Applic. 24 (1968), 2, 440-445. | MR | Zbl
[4] Lippman S. A.: Criterion Equivalence in Discrete Dynamic Programming. Operations Research 17 (1969), 5, 920-923. | MR
[5] Mandl P.: On the Variance in Controlled Markov Chains. Kybernetika 7 (1971), 1, 1-12. | MR | Zbl
[6] Miller B. L., Veinott A. F.: Discrete Dynamic Programming with a Small Interest Rate. Annals Mathem. Statistics 40 (1969), 2, 366-370. | MR | Zbl
[7] Sladký K.: Necessary and Sufficient Optimality Conditions for Average Reward of Controlled Markov Chains. Kybernetika 9 (1973), 2, 124-137. | MR | Zbl
[8] Veinott A. F.: On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting. Annals Mathem. Statistics 37 (1966), 5, 1284-1294. | MR | Zbl
[9] Veinott A. F.: Discrete Dynamic Programming with Sensitive Discount Optimality Criteria. Annals Mathem. Statistics 40 (1969), 5, 1635-1660. | MR | Zbl
[10] Hardy G. H.: Divergent Series. Oxford Univ. Press, Oxford 1949. | Zbl