Linear Methods are often used to compute approximate solutions to dynamic models, as these models often cannot be solved analytically. Linear methods are very popular, as they can easily be implemented. Also, they provide a useful starting point for understanding more elaborate numerical...

This paper evaluates the accuracy of a set of techniques that approximate the solution of continuous-time DSGE models. Using the neoclassical growth model I compare linear-quadratic, perturbation and projection methods. All techniques are applied to the HJB equation and the optimality conditions...

We propose a simple risk-adjusted linear approximation to solve a large class of dynamic models with time-varying and non-Gaussian risk. Our approach generalizes lognormal affine approximations commonly used in the macro-finance literature and can be seen as a first-order perturbation around the...

We propose a simple risk-adjusted linear approximation to solve a large class of dynamic models with time-varying and non-Gaussian risk. Our approach generalizes lognormal affine approximations commonly used in the macro-finance literature and can be seen as a first-order perturbation around the...

Value function iteration is one of the standard tools for the solution of the Ramsey model. We compare six different ways of value function iteration with regard to speed and precision. We find that value function iteration with cubic spline interpolation between grid points dominates the other...

We construct the first algorithm for the perfect foresight solution of otherwise linear models with occasionally binding constraints, with fixed terminal conditions, that is guaranteed to return a solution in finite time, if one exists. We also provide a proof of the inescapability of the "curse...

We construct an optimizing-agent model of a closed economy which is simple enough that we can use it to make exact utility calculations. There is a stabilization problem because there are one-period nominal contracts for wages, or prices, or both and shocks that are unknown at the time when...

Two heuristics based on branch and bound (B&B) are developed to solve closed-loop material requirements planning (MRP) lot-sizing problems that have general product structures and variable costs. A “look ahead method'’(LAM) heuristic allows for variable production/purchasing costs and uses a...

The research on lot sizing is extensive; however, no author in the literature reviewed to date provides an optimal solution algorithm to a prevalent problem which is found in manufacturing. A multi-level, general product-structure, variable-cost model is presented which follows the procedure of a...