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