We develop an envelope condition method (ECM) for dynamic programming problems –a tractable alternative to expensive conventional value function iteration. ECM has two novel features: First, to reduce the cost, ECM replaces expensive backward iteration on Bellman equation with relatively...

We introduce the market resources method (MRM) for solving dynamic optimization problems. MRM extends Carroll's (2006) endogenous grid point method (EGM) for problems with more than one control variable using policy function iteration. The MRM algorithm is simple to implement and provides...

We introduce the market resources method (MRM) for solving dynamic optimization problems. MRM extends Carroll’s (2006) endogenous grid point method (EGM) for problems with more than one control variable using policy function iteration. The MRM algorithm is simple to implement and provides...

We study a generalized version of Coleman (1990)'s time iteration method (GTI) for solving dynamic optimization problems. Our benchmark framework is an irreversible investment model with labor-leisure choice. The GTI algorithm is simple to implement and provides advantages in terms of speed...

We study a generalized version of Coleman (1990)’s time iteration method (GTI) for solving dynamic optimization problems. Our benchmark framework is an irreversible investment model with labor-leisure choice. The GTI algorithm is simple to implement and provides advantages in terms of speed...

We introduce an envelope condition method (ECM) for solving dynamic programming problems. ECM iterates on the Bellman equation forward and is much faster than conventional value function methods that iterate backward. In the studied examples, ECM is comparable in accuracy and cost to Carroll's...

Dynamic Programming (DP) is a process of deriving an optimal solution to a mathematical problem that has an objective function and environmentally varying limitations. DP has some difficulties to set up structural equations as in other management science techniques. In this context, DP,...

Strategies for constructing a Markov decision chain approximating a continuous-time finite-horizon optimal control problem are investigated. Some simple, analytically soluble, examples are treated and low computational complexity is reported. Extensions to the method and implementation are...

We reconsider the stochastic dynamic program of revenue management with flexible products and customer choice behavior as proposed in the seminal paper by Gallego et al. [Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Working paper, Columbia University,...

This paper describes a method for solving a class of forward-looking Markov-switching Rational Expectations models under noisy measurement, by specifying the unobservable expectations component as a general-measurable function of the observable states of the system, to be determined optimally...