Stochastic Optimization over a Pareto Set Associated with a Stochastic MultiObjective Optimization Problem
Abstract
We deal with the problem of minimizing the expectation of a real valued random function over the weakly Pareto or Pareto set associated with a Stochastic Multiobjective Optimization Problem, whose objectives are expectations of random functions. Assuming that the closed form of these expectations is difficult to obtain, we apply the Sample Average Approximation method in order to approach this problem. We prove that the HausdorffPompeiu distance between the weakly Pareto sets associated with the Sample Average Approximation problem and the true weakly Pareto set converges to zero almost surely as the sample size goes to infinity, assuming that our Stochastic Multiobjective Optimization Problem is strictly convex. Then we show that every cluster point of any sequence of optimal solutions of the Sample Average Approximation problems is almost surely a true optimal solution. To handle also the nonconvex case, we assume that the real objective to be minimized over the Pareto set depends on the expectations of the objectives of the Stochastic Optimization Problem, i.e. we optimize over the image space of the Stochastic Optimization Problem. Then, without any convexity hypothesis, we obtain the same type of results for the Pareto sets in the image spaces. Thus we show that the sequence of optimal values of the Sample Average Approximation problems converges almost surely to the true optimal value as the sample size goes to infinity. © 2013 Springer Science+Business Media New York.
Citation
Source Title
ISSN
School
Collection
Related items
Showing items related by title, author, creator and subject.

Bonnel, Henri; Collonge, J. (2014)Our paper consists of two main parts. In the first one, we deal with the deterministic problem of minimizing a real valued function (Formula presented.) over the Pareto outcome set associated with a deterministic convex ...

Bonnel, Henri; Collonge, J. (2014)© 2014, Springer Science+Business Media New York. Our paper consists of two main parts. In the first one, we deal with the deterministic problem of minimizing a real valued function $$f$$f over the Pareto outcome set ...

Chong, Yen N. (2001)General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution ...