Demin, V. K.; Osadchenko, A. A. Decomposition for the control of Markovian processes. (English. Russian original) Zbl 0518.90094 Cybernetics 18, 383-389 (1982); translation from Kibernetika 1982, No. 3, 98-103 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 90C40 Markov and semi-Markov decision processes 90C06 Large-scale problems in mathematical programming 65K05 Numerical mathematical programming methods 90C05 Linear programming Keywords:optimal strategy; finite controllable Markov process; decomposition; single ergodic class; separation of variables; algorithm; tree structure PDFBibTeX XMLCite \textit{V. K. Demin} and \textit{A. A. Osadchenko}, Cybernetics 18, 383--389 (1982; Zbl 0518.90094); translation from Kibernetika 1982, No. 3, 98--103 (1982) Full Text: DOI References: [1] H. Mine and S. Osaki, Markovian Decision Processes, Elsevier, New York (1970). [2] G. B. Dantzig and P. Wolfe, ?The decomposition algorithm for linear programming,? Econometrica,9, No. 4, 113?120 (1961). · Zbl 0104.14305 [3] L. S. Lasdon, Optimization Theory for Large Systems, Macmillan, New York (1970). · Zbl 0224.90038 [4] R. A. Howard, Dynamic Programming and Markov Processes, MIT Press, Cambridge, Mass. (1960). · Zbl 0091.16001 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.