Article ID: | iaor20124815 |
Volume: | 154 |
Issue: | 3 |
Start Page Number: | 857 |
End Page Number: | 878 |
Publication Date: | Sep 2012 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Brasch Thomas, Bystrm Johan, Lystad Lars |
Keywords: | programming: dynamic |
We bridge mathematical number theory with optimal control and show that a generalised Fibonacci sequence enters the control function of finite‐horizon dynamic optimisation problems with one state and one control variable. In particular, we show that the recursive expression describing the first‐order approximation of the control function can be written in terms of a generalised Fibonacci sequence when restricting the final state to equal the steady‐state of the system. Further, by deriving the solution to this sequence, we are able to write the first‐order approximation of optimal control explicitly. Our procedure is illustrated in an example often referred to as the Brock–Mirman economic growth model.