Question: Let be the value function for the dynamic programming problem (example 2.32). Assume that ¢ f is bounded on X Ã X ¢ G(x) is
be the value function for the dynamic programming problem (example 2.32). Assume that
¢ f is bounded on X Ã X
¢ G(x) is nonempty for every x X
Show that the plan x* = (x0, x*1, x*2, ...) Î (x0) is optimal if and only if it satisfies Bellman's equation
v(x*1) = f(x*t , x*t+1) + βv(x*t+1), t = 0, 1, 2,... (13)
xel(o)
Step by Step Solution
3.61 Rating (158 Votes )
There are 3 Steps involved in it
Assume x is optimal so that x x for every x 0 This implies using 239 0 1 x 0 1 x where x 1 2 ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
914-M-N-A-O (357).docx
120 KBs Word File
