Using dynamic programming with adaptive grid scheme for optimal control problems in economics

The study of the solutions of dynamic models with optimizing agents has often been limited by a lack of available analytical techniques to explicitly find the global solution paths. On the other hand, the application of numerical techniques such as dynamic programming to find the solution in interesting regions of the state was restricted by the use of fixed grid size techniques. Following Grüne (Numer. Math. 75 (3) (1997) 319; University of Bayreuth, submitted, 2003), in this paper an adaptive grid scheme is used for finding the global solutions of discrete time Hamilton–Jacobi–Bellman equations. Local error estimates are established and an adapting iteration for the discretization of the state space is developed. The advantage of the use of adaptive grid scheme is demonstrated by computing the solutions of one- and two-dimensional economic models which exhibit steep curvature, complicated dynamics due to multiple equilibria, thresholds (Skiba sets) separating domains of attraction and periodic solutions. We consider deterministic and stochastic model variants. The studied examples are from economic growth, investment theory, environmental and resource economics.     

Using nonlinear model predictive control for dynamic decision problems in economics

This paper presents a new approach to solve dynamic decision models in economics. The proposed procedure, called Nonlinear Model Predictive Control (NMPC), relies on the iterative solution of optimal control problems on finite time horizons and is well established in engineering applications for stabilization and tracking problems. Only quite recently, extensions to more general optimal control problems including those appearing in economic applications have been investigated. Like Dynamic Programming (DP), NMPC does not rely on linearization techniques but uses the full nonlinear model and in this sense provides a global solution to the problem. However, unlike DP, NMPC only computes one optimal trajectory at a time, thus avoids to grid the state space and for this reason the computational demand grows much more moderately with the space dimension than for DP. In this paper we explain the basic idea of NMPC, give a proof concerning the accuracy of NMPC for discounted optimal control problems, present implementational details, and demonstrate the ability of NMPC to solve dynamic decision problems in economics by solving low and high dimensional examples, including models with multiple equilibria, tracking and stochastic problems.