Solving Dynamic Stochastic Economic Models by Mathematical Programming Decomposition Methods Articles
Overview
published in
- COMPUTERS & OPERATIONS RESEARCH Journal
publication date
- January 2008
start page
- 226
end page
- 240
issue
- 1
volume
- 35
Digital Object Identifier (DOI)
International Standard Serial Number (ISSN)
- 0305-0548
Electronic International Standard Serial Number (EISSN)
- 1873-765X
abstract
- Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic problems are still quite challenging to solve. Economists are aware of the limitations of some of these approaches for solving these problems due to memory and computational requirements. However, many of the economic models present some special structure that can be exploited in an efficient manner. This paper introduces a decomposition methodology, based on a mathematical programming framework, to compute the equilibrium path in dynamic models by breaking the problem into a set of smaller independent subproblems. We study the performance of the method solving a set of dynamic stochastic economic models. The numerical results reveal that the proposed methodology is efficient in terms of computing time and accuracy.