Minmax robustness for multi-objective optimization problems

Matthias Ehrgott

doi:10.1016/j.ejor.2014.03.013

Minmax robustness for multi-objective optimization problems

2014-11-01

226

PRE

AI

DOI：10.1016/j.ejor.2014.03.013

原文链接

原文求助

摘要

En 中文

In real-world applications of optimization, optimal solutions are often of limited value, because disturbances of or changes to input data may diminish the quality of an optimal solution or even render it infeasible. One way to deal with uncertain input data is robust optimization, the aim of which is to find solutions which remain feasible and of good quality for all possible scenarios, i.e., realizations of the uncertain data. For single objective optimization, several definitions of robustness have been thoroughly analyzed and robust optimization methods have been developed. In this paper, we extend the concept of minmax robustness (Ben-Tal, Ghaoui, 82 Nemirovski, 2009) to multi-objective optimization and call this extension robust efficiency for uncertain multi-objective optimization problems. We use ingredients from robust (single objective) and (deterministic) multi-objective optimization to gain insight into the new area of robust multi-objective optimization. We analyze the new concept and discuss how robust solutions of multi-objective optimization problems may be computed. To this end, we use techniques from both robust (single objective) and (deterministic) multi-objective optimization. The new concepts are illustrated with some linear and quadratic programming instances. (C) 2014 Elsevier B.V. All rights reserved.

Keyword:

Multi-objective optimization

Robustness and sensitivity analysis

Scenarios

Uncertainty modelling

Minmax robustness for multi-objective optimization problems

摘要

期刊

机构