Article ID Journal Published Year Pages File Type
479818 European Journal of Operational Research 2014 12 Pages PDF
Abstract

•Multiobjective optimization problems with uncertainty can easily be robustified.•The concept of the robust Pareto front is introduced.•Applications to Markowitz portfolio optimization are described in detail.

Motivated by Markowitz portfolio optimization problems under uncertainty in the problem data, we consider general convex parametric multiobjective optimization problems under data uncertainty. For the first time, this uncertainty is treated by a robust multiobjective formulation in the gist of Ben-Tal and Nemirovski. For this novel formulation, we investigate its relationship to the original multiobjective formulation as well as to its scalarizations. Further, we provide a characterization of the location of the robust Pareto frontier with respect to the corresponding original Pareto frontier and show that standard techniques from multiobjective optimization can be employed to characterize this robust efficient frontier. We illustrate our results based on a standard mean–variance problem.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,