Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Dynamic Programming

  1. Dec 9, 2011 #1
    How do we solve optimization problems with infinite horizon. I tried to look online for some guidance but nothing but just problems and no solution methods. For example how can I solve:

    maximize a_t [itex]\in[/itex][0,1]
    where sum goes from 0 to T-1
    subject to: s_t+1 = s_t *(1+a_t)

    Some sources say we can use backwards induction but doesn't really tell me how I can do so.
    Can someone explain the methodology or direct me to somewhere that explains it.

  2. jcsd
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted

Similar Threads for Dynamic Programming
I A common 2nd order ODE from dynamics but...