Abstract
I introduce a finite-difference solution method based on the envelope condition in continuous-time stochastic dynamic programming problems. The envelope method is easier to code and, in the presence of occasionally binding constraints, faster and more stable than popular methods based on the Hamilton–Jacobi–Bellman equation. As an illustration, I solve a stochastic growth model with irreversible investment.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
