Economists who want to numerically approximate an elaborate dynamic stochastic programming problem (DSPP), either for structural estimation or policy evaluation purposes, are often confined by the curse of dimensionality: richer models with various state and control variables cannot be solved on...

We propose two modifications to the method of endogenous grid points that greatly decreases the computational time for life cycle models with many exogenous state variables. First, we use simulated stochastic grids on the exogenous state variables. Second, when we interpolate to find the...

We present a fast and accurate computational method for solving and estimating a class of dynamic programming models with discrete and continuous choice variables. The solution method we develop for structural estimation extends the en- dogenous grid-point method (EGM) to discrete-continuous...

Telecommunication networks are characterised by a complex group of intermediaries and each one of them faces two types of operational costs: transmission costs and delivery cost. This scheme allows the operator to evaluate the market structure and to perform the telecommunication service. The...

This paper proposes a novel method of global optimization based on cuckoo-host co-evaluation. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 96 benchmark functions (of which the results of 30 relatively harder problems have been reported). The proposed...

In this contribution we propose a dynamic tracking error problem and we consider the problem of monitoring at discrete point the shortfall of the portfolio below a set of given reference levels of wealth. We formulate and solve the resulting dynamic optimization problem using stochastic...

In this contribution we propose an approach to solve a multistage stochastic programming problem which allows us to obtain a time and nodal decomposition of the original problem. This double decomposition is achieved applying a discrete time optimal control formulation to the original stochastic...

We propose a new class of knapsack problems by assiuning that the sizes of the items to be put into a knapsack are known to be elements 0f a given subset S of the positive integers Z'^. The set S is treated as a parameter. We show that the family of knapsack problems obtained by varying the...

In the economics of joint production one often distinguishes between the two cases: the one in which a firm produces multiple products each produced under separate production process, and the other "true joint production" where a number of outputs are produced from a single production process,...

For simulation to be truly useful for investigating many problems in agricultural economics, non-simplifying optimization techniques need to be employed. General methods for simulation optimization that do not inhibit system characterization or analysis are available, and they would appear to...