A Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics

Hui He, Hao Zhang

Author information


a School of Economics, and Key Laboratory of Mathematical Economics, Shanghai University of Finance and Economics, Shanghai 200433, China

b School of Labor and Human Resources, Renmin University of China, Beijing 100872, China

E-mail: he.hui@mail.shufe.edu.cn (Hui He), hao.zhang@ruc.edu.cn (Hao Zhang)


Abstract


We introduce a rapid grid search method in solving dynamic programming problems in economics. Compared to mainstream grid search methods, by using local information of the Bellman equation, this method can significantly increase the efficiency in solving dynamic programming problems by reducing the grid points searched in the control space.


Keywords


dynamic programming , Bellman equation , grid search , concavity , searching efficiency 


Cite this article


Hui He, Hao Zhang. A Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics. Front Econ Chin, 2013, 8(2): 260‒271 https://doi.org/10.3868/s060-002-013-0013-4 


About ISE | Contact ISE | Links | SUFE-IAR | SUFE
All Rights Reserved:2020 Institute for Advanced Research,
Shanghai University of Finance and Economics.777 Guoding Rd, Shanghai, PRC,200433