Article contents
On the dynamic programming approach to Pontriagin's maximum principle
Published online by Cambridge University Press: 14 July 2016
Extract
Suppose that the state variables x = (x1,…,xn)′ where the dot refers to derivatives with respect to time t, and u ∊ U is a vector of controls. The object is to transfer x to x1 by choosing the controls so that the functional takes on its minimum value J(x) called the Bellman function (although we shall define it in a different way). The Dynamic Programming Principle leads to the maximisation with respect to u of and equality is obtained upon maximisation.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1968
References
- 2
- Cited by