๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Theory of Dynamic Programming as Applied to a Smoothing Problem

โœ Scribed by Bellman, R.; Glicksberg, I.; Gross, O.


Book ID
118193067
Publisher
Society for Industrial and Applied Mathematics
Year
1954
Weight
518 KB
Volume
2
Category
Article
ISSN
0368-4245

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Dynamic programming and a max-min proble
โœ Nestor Distefano ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 674 KB

A max-min problem in the realm of optimum beam design is formulated and thoroughly investigated from a dynamic programming point of view. It is shown that the conditions of optimality can be directly derived from the Hamilton-Jacobi-Bellman equation of the process. The classical Euler-Lagrange equat