✦ LIBER ✦

On the reduction of dimensionality for classes of dynamic programming processes

✍ Scribed by Richard Bellman

Publisher: Elsevier Science
Year: 1961
Tongue: English
Weight: 125 KB
Volume: 3
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(61)90062-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A technique for the reduction of dimensi

A technique for the reduction of dimensionality in dynamic programming

✍ Richard Bellman; Mohammad Roosta 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Reduction of dimensionality in dynamic p

Reduction of dimensionality in dynamic programming via the method of diagonal decomposition

✍ D.C Collins 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 592 KB

On the reduction of certain dynamic prog

On the reduction of certain dynamic programming problems for nonlinear systems to transcendental equations

✍ Ia.N Roitenberg 📂 Article 📅 1962 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Reduction of allowable values for contro

Reduction of allowable values for control in iterative dynamic programming

✍ V. Tassone; R. Luus 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 429 KB

On the reduction of associate classes fo

On the reduction of associate classes for the PBB designs

✍ Henryk Brzeskwiniewicz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Existence Theorems of Solutions for Cert

Existence Theorems of Solutions for Certain Classes of Functional Equations Arising in Dynamic Programming

✍ Zeqing Liu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 147 KB

In this paper we study the existence, uniqueness, and iterative approximation of solutions for certain classes of functional equations arising in dynamic programming of multistage decision processes. The results presented here generalize, improve, and unify the corresponding results of other authors