Résumé en anglais

Multi-objective optimization problems often lead to large nondominated sets, as the size of the problem or the number of objectives increases. Generating the whole nondominated set requires significant computation time, while most of the corresponding solutions are irrelevant to the decision maker (DM). Optimizing an aggregation function reduces the computation time and produces one or a very limited number of more focused solutions. This requires, however, the elicitation of precise preference parameters, which is often difficult and partly arbitrary, and might discard solutions of interest. An intermediate approach consists in using partial preference information with an aggregation function. In this work, we present a preference relation based on the weighted sum aggregation, where weights are not precisely defined. We give some properties of this preference relation and define the set of preferred points as the set of nondominated points with respect to this relation. We provide an efficient and generic way of generating this preferred set using any standard multi-objective optimization algorithm. This approach shows competitive performances both on computation time and quality of the generated preferred set.