Please wait a minute...

Frontiers of Economics in China

Front Econ Chin    2013, Vol. 8 Issue (2) : 260-271
A Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics
Hui He1(), Hao Zhang2()
1. School of Economics, and Key Laboratory of Mathematical Economics, Shanghai University of Finance and Economics, Shanghai 200433, China; 2. School of Labor and Human Resources, Renmin University of China, Beijing 100872, China
Download: PDF(1866 KB)   HTML
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

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     
Corresponding Author(s): Hui He,; Hao Zhang,   
Issue Date: 05 June 2013
 Cite this article:   
Hui He,Hao Zhang. A Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics[J]. Front Econ Chin, 2013, 8(2): 260-271.
E-mail this article
E-mail Alert
Articles by authors
Hui He
Hao Zhang
Related articles from Frontiers Journals
[1] Jian Li, Yao Lu. Existence and Stability of Steady State in an Augmented Solow Model with Multiple Capital Goods[J]. Front. Econ. China, 2018, 13(4): 685-702.
Full text