Optimization over the Pareto outcome set associated with a convex biobjective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
Abstract
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 biobjective optimization problem (BOP), in the particular case where (Formula presented.) depends on the objectives of (BOP), i.e. we optimize over the Pareto set in the outcome space. In general, the optimal value (Formula presented.) of such a kind of problem cannot be computed directly, so we propose a deterministic outcome space algorithm whose principle is to give at every step a range (lower bound, upper bound) that contains (Formula presented.). Then we show that for any given error bound, the algorithm terminates in a finite number of steps. In the second part of our paper, in order to handle also the stochastic case, we consider the situation where the two objectives of (BOP) are given by expectations of random functions, and we deal with the stochastic problem (Formula presented.) of minimizing a real valued function (Formula presented.) over the Pareto outcome set associated with this Stochastic biobjective Optimization Problem (SBOP). Because of the presence of random functions, the Pareto set associated with this type of problem cannot be explicitly given, and thus it is not possible to compute the optimal value (Formula presented.) of problem (Formula presented.). That is why we consider a sequence of Sample Average Approximation problems (SAA(Formula presented.), where (Formula presented.) is the sample size) whose optimal values converge almost surely to (Formula presented.) as the sample size (Formula presented.) goes to infinity. Assuming (Formula presented.) nondecreasing, we show that the convergence rate is exponential, and we propose a confidence interval for (Formula presented.). Finally, some computational results are given to illustrate the paper.
Citation
Source Title
ISSN
School
Collection
Related items
Showing items related by title, author, creator and subject.

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 ...

Liu, Chunmin (2008)The optimization problems involving stochastic systems are often encountered in financial systems, networks design and routing, supplychain management, actuarial science, telecommunications systems, statistical pattern ...

Bonnel, Henri; Collonge, J. (2014)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 ...