Redundant objectives in multiobjective optimization

This work examines three different concepts of objective redundancy in multiobjective optimization. Multiobjective optimization is known to suffer from the curse of dimensionality and we aim at reducing the number of objective functions which need to be considered. In this context, a set of objectives is called redundant if the sets of weakly efficient, efficient, … Read more

Convexlikeness and Supportedness in Quadratic Multiobjective Optimization

This paper studies geometric and structural properties of quadratic multiobjective optimization problems. Thereby, a multiobjective optimization problem is called convexlike if the upper image, i.e., the image set plus the nonnegative orthant, is a convex set. Moreover, we say that a feasible point is supported in case it is a minimal solution of a weighted … Read more