Pareto Optimal Solutions for Stochastic Dynamic Programming Problems via Monte Carlo Simulation

Abstract EN

A heuristic algorithm is proposed for a class of stochastic discrete-time continuous-variable dynamic programming problems submitted to non-Gaussian disturbances.

Instead of using the expected values of the objective function, the randomness nature of the decision variables is kept along the process, while Pareto fronts weighted by all quantiles of the objective function are determined.

Thus, decision makers are able to choose any quantile they wish.

This new idea is carried out by using Monte Carlo simulations embedded in an approximate algorithm proposed to deterministic dynamic programming problems.

The new method is tested in instances of the classical inventory control problem.

The results obtained attest for the efficiency and efficacy of the algorithm in solving these important stochastic optimization problems.