What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
allocation analysis analytic approximation in policy assume assumption Bellman calculus of variations Chapter choice computational concave function Consider the problem constraints continuous function convergence convex convex function corresponding cost decision processes defined derive determining the maximum discussion dxjdt Dynamic Programming exer existence and uniqueness expected value finite formulation FULL SCORE functional equation Hence inequality initial interval JV-stage Lemma linear machine mathematical method min-max theorem minimize minimum mixed policy nonlinear obtain optimal policy partial differential equation policy space probability problem of determining problem of maximizing proof quantity RAND Corporation recurrence relation region result satisfies sequence Show solution stage Stieltjes integrals stochastic successive approximations technique theory tion total return uniqueness theorems variables variational problem vector yields
From Google Scholar
RE Bellman, LA Zadeh - 1970 - Management Science
Wolfram Schultz, Peter Dayan, P Read Montague - 1997 - Science
DQ Mayne, JB Rawlings, CV Rao, POM Scokaert - 2000 - Automatica
All Scholar search results »
STEPHEN E DEERING, DAVID R CHERITON - 1990 - ACM Transactions on Computer Systems
Dynamic programming - Wikipedia, the free encyclopedia
Dynamic programming: an introduction
What is dynamic programming?
Interpolating Value Functions in Discrete Choice Dynamic ...
What is dynamic programming? - Nature Biotechnology
Chapter 6 Dynamic Programming
Fuzzy dynamic programming: theory and applications to decision and ...
JSTOR: Dynamic Programming and the Calculus of Variations.
Dynamic Programming: A Discrete Calculus of Variations