Geodesic
Řízené Markovovy řetězce
Kybernetika, Tome 5 (1969), pp. 1-72
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 90C40, 93E20 
@article{KYB_1969_5_Suppl1_a0,
     author = {Mandl, Petr},
     title = {\v{R}{\'\i}zen\'e {Markovovy} \v{r}et\v{e}zce},
     journal = {Kybernetika},
     pages = {1--72},
     year = {1969},
     volume = {5},
     number = {Suppl1},
     mrnumber = {0434456},
     zbl = {0187.17902},
     language = {cs},
     url = {http://geodesic.mathdoc.fr/item/KYB_1969_5_Suppl1_a0/}
}
TY  - JOUR
AU  - Mandl, Petr
TI  - Řízené Markovovy řetězce
JO  - Kybernetika
PY  - 1969
SP  - 1
EP  - 72
VL  - 5
IS  - Suppl1
UR  - http://geodesic.mathdoc.fr/item/KYB_1969_5_Suppl1_a0/
LA  - cs
ID  - KYB_1969_5_Suppl1_a0
ER  - 
%0 Journal Article
%A Mandl, Petr
%T Řízené Markovovy řetězce
%J Kybernetika
%D 1969
%P 1-72
%V 5
%N Suppl1
%U http://geodesic.mathdoc.fr/item/KYB_1969_5_Suppl1_a0/
%G cs
%F KYB_1969_5_Suppl1_a0
Mandl, Petr. Řízené Markovovy řetězce. Kybernetika, Tome 5 (1969), pp. 1-72. http://geodesic.mathdoc.fr/item/KYB_1969_5_Suppl1_a0/

R. Bellman: Dynamic programming. Princeton 1957. | MR | Zbl

R. Bellman S. Dreyfus: Applied dynamic programming. Princeton 1962. | MR

W. Feller: An introduction to probability theory and its applications. New York, London 1957. | Zbl

Ф. P. Гантмахер: Теория матриц. Москва 1966. | Zbl

T. E. Harris: The theory of branching processes. Berlin, Göttingen, Heidelberg 1963. | MR | Zbl

R. A. Howard: Dynamic programming and Markov processes. New York, London 1960. | MR | Zbl

Kai Lai Chung: Markov chains with stationary transition probabilities. Berlin, Göttingen, Heidelberg 1960. | MR

J. G. Kemeny J. L. Snell: Finite Markov chains. Princeton 1960. | MR

T. A. Сарымсаков: Основы теории процессов Маркова. Москва 1954. | Zbl

K. J. Åström: Optimal control of Markov processes with incomplete state information. J. of Math. Analysis and Appl. 10 (1965), 174-204. | MR

R. Bellman: A Markovian decision process. J. of Math. and Mech. 6 (1957), 679-684. | MR | Zbl

D. Blackwell: Discrete dynamic programming. AMS 33 (1962), 719-726. | MR | Zbl

D. Blackwell: Memoryless strategies in finite stage dynamic programming. AMS 35 (1964), 863-865. | MR | Zbl

D. Blackwell: Discounted dynamic programming. AMS 36 (1965), 226-235. | MR | Zbl

C. Derman: Stable sequential control rules and Markov chains. J. of Math. Analysis and Appl. 6 (1963), 257-265. | MR | Zbl

C. Derman: Markovian sequential decision processes. Proc. of Symp. on Applied Math. XVI. Providence 1964, 281-289. | MR | Zbl

C. Derman: On sequential control processes. AMS 35 (1964), 341-349. | MR | Zbl

C. Derman: Markovian sequential control processes with denumerable state space. J. of Math. Analysis and Appl. 10 (1965), 295-301. | MR

C. Derman: Denumerable state Markovian decision processes. Average cost criterion. AMS 37 (1966), 1545-1553. | MR | Zbl

C. Derman G. J. Lieberman: A Markovian decision model for a joint replacement and stocking problem. Management Sc. 13 (1967), 609-617.

C. Derman R. E. Strauch: A note on memoryless rules for controlling sequential control processes. AMS 37 (1966), 276-278. | MR

E. Б. Дынкин: Упpaвляeмыe cлyчaйныe пocлeдoвaтeльнocти. TBП X (1965), 3-18.

J. H. Eaton L. A. Zadeh: Optimal pursuit strategies in discrete state probabilistic systems. Transactions of ASME Ser. D, J. of Basic Engineering 84 (1961), 23-29. | MR

H. Hatori: On Markov chains with rewards. Kodai math. seminar reports 18 (1966), 184-192. | MR | Zbl

H. Hatori: On continuous-time Markov processes with rewards I. Tamtéž 212-218. | Zbl

H. Hatori T. Mori: On continuous-time Markov processes with rewards II. Tamtéž 353-356. | MR

R. A. Howard: Research in semi-Markovian decision structures. J. of Operations Res. Soc. of Japan 6 (1964), 163-199. | MR

R. A. Howard: System analysis of semi-Markov processes. IEEE Transactions, Milit. Electron. 8 (1964), 114-124.

R. A. Howard: Dynamic inference. Operations Res. 13 (1965), 712-733. | MR | Zbl

M. Iosifescu P. Mandl: Application des systèmes à liaisons complètes à un problème de réglage. Rev. roum. Math. pures et appl. XI (1966), 533-539. | MR

W. S. Jewell: Markov renewal programming I, II. Operations Res. 11 (1963), 938-971. | MR

Z. Koutský: O jedné úloze optimálního rozhodování v markovských procesech. Ekon. matem. obzor 1 (1965), 370-382.

H. B. Крылов: Пocтpoeниe oптимaльнoй cтpaтeгии для кoнeчнoй yпpaвляeмoй цeпи. TBП X (1965), 51-60.

A. Maitra: Dynamic programming for countable state systems. Sankhyã A 27 (1965), 241-248. | MR | Zbl

P. Mandl: An iterative method for maximizing the characteristic root of positive matrices. Rev. roum. Math. pures et appl. XII (1967), 1305-1310. | MR | Zbl

И. B. Poмaнoвcкий: Cyщecтвoвaниe oптимaльнoгo cтaциoнapнoгo yпpaвлeния в мapкoвcкoм пpoцecce peшeния. TBП X (1965), 130-133.

B. B. Pыкoв: Упpaвляeмыe мapкoвcкиe пpoцeccы c кoнeчными пpocтpaнcтвaми cocтoяний и yпpaвлeний. TBП XI (1966), 343-351.

R. E. Strauch: Negative dynamic programming. AMS 37 (1966), 871-890. | MR | Zbl

A. H. Шиpяeв: K тeopии peшaющиx фyҥкций и yпpaвлeнию пpoцeccoм нaблюдeния пo нeпoльным дaнным. Transactions of the Third Prague Conference on Information Theory etc., Prague 1964, 657-682.

A. H. Шиpяeв: Пocлeдoвaтeльный aнaлиз и yпpaвляeмыe cлyчaйныe пpoцeccы (диcкpeтнoe вpeмя). Kибepнeтикa (1965), 1-24.

A. H. Шиpяeв: Heкoтopыe нoвыe peзyльтaты в тeopии yпpaвляeмыx cлyчaйныx пpoцeccoв. Transactions of the Fourth Prague Conference on Information Theory etc., Prague 1967, 131-203.

O. B. Bиcкoв A. H. Шиpяeв: Oб yпpaвлeнияx пpивoдящиx к oптимaльным cтaциoнapным peжимaм. Tpyды мaтeм. инcт. им. B. A. Cтeклoвa LXXI, Mocквa 1964, 35-45.

P. Wolfe G. B. Dantzig: Linear programming in a Markov chain. Operations Res. 10 (1962), 702-710. | MR