This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. M. Ermol'ev, “On optimal control of stochastic processes,” Kibernetika, No. 2, 64–76 (1970).
T. Morozan, “Foundations of the dynamic programming approach for discrete-time stochastic control problems,” Rev. Roum. Math. Pures Appl.,22, No. 6, 797–804 (1977).
V. I. Arkin and L. I. Krečetov, “A stochastic maximum principle in control problems with discrete time,” in: Proc. Third Japan-USSR Symp. Prob. Theory, Lecture Notes in Mathematics, Vol. 550, Springer-Verlag, New York (1976), pp. 692–713.
I. Z. Fel'dman, “Problems in optimization of discrete-time stochastic systems,” Diskretnye Sistemy, No. 9, 75–88 (1971).
E. B. Dynkin and I. V. Evstigneev, “Regular conditional mathematical expectations of correspondences,” Teor. Veroyatn. Ee Primen.,21, No. 2, 334–347 (1976).
A. D. Ioffe and V. M. Tikhomorov, Theory of Extremal Problems [in Russian], Nauka, Moscow (1974).
C. J. Himmelberg, “Measurable relations,” Fund. Math.,87, No. I, 53–72 (1975).
K. Kuratowski, Topology, Vol. 1, Academic Press (1966).
V. I. Arkin and V. L. Levin, “Convexity of values of vector integrals, measurable selection theorems, and variational problems,” Usp. Mat. Nauk,27, No. 3, 27–78 (1972).
K. Kuratowski, Topology, Vol. 2, Academic Press (1969).
M. Shal, “Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal,” Z. Wahr. Verw. Geb.,32, 179–196 (1975).
C. Berge, Espaces topologiques et fonctions multivoques, Dunod, Paris (1959).
C. Castaing, “Sur les multi-applications mesurables,” Rev. Francais Inf. No. 1, 91–126 (1967).
I. V. Evstigneev, “Measurable selection and the axiom of the continuum,” Dokl. Akad. Nauk SSSR,238, No. 1, 11–14 (1978).
R. E. Bellman and R. Kalaba, Dynamic Programming and Modern Control, Academic Press (1966).
Additional information
V. Kapsukas Vilnius State University. Translated from Litovskii Matematicheskii Sbornik (Lietuvos Matematikos Rinkinys), Vol. 19, No. 2, pp. 167–177, April–June, 1979.
Rights and permissions
About this article
Cite this article
Rupśys, P. Dynamic programming for discrete-time stochastic systems of a general type. Lith Math J 19, 270–276 (1979). https://doi.org/10.1007/BF00970617
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00970617