Dynamic Programming


by yamdizzle
Tags: dynamic, programming
yamdizzle
yamdizzle is offline
#1
Dec9-11, 09:57 PM
P: 15
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]
[itex]\sum\frac{-2a_t}{3}[/itex]+log(S_T)
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.

Thanks
Phys.Org News Partner Science news on Phys.org
SensaBubble: It's a bubble, but not as we know it (w/ video)
The hemihelix: Scientists discover a new shape using rubber bands (w/ video)
Microbes provide insights into evolution of human language

Register to reply

Related Discussions
Dynamic Programming to maximize profit Calculus & Beyond Homework 0
Sequence Alignment and Dynamic Programming Biology, Chemistry & Other Homework 0
Recommended programming language (and texts) for middle-school beginner programming Programming & Computer Science 9
Dynamic Programming Related Questions General Math 3
Dynamic Introductory Physics Homework 3