This note deals with the manner in which dynamic problems, involving probabilistic constraints, may be tackled using the ideas of Lagrange multipliers and efficient solutions. Both the infinite and ...

The policy iteration method of dynamic programming is studied in an abstract setting. It is shown to be equivalent to the Newton-Kantorovich iteration procedure applied to the functional equation of ...