Multiobjective mixed integer convex optimization refers to mathematical programming
problems where more than one convex objective function needs to be optimized …

Recent developments in set optimization are surveyed and extended including various set
relations as well as fundamental constructions of a convex analysis for set-and vector …

A new branch--and--bound-based algorithm for smooth nonconvex multiobjective
optimization problems with convex constraints is presented. The algorithm computes a so …

The survey highlights some of the research topics which have attracted attention in the last
two decades within the area of mathematical optimization of multiple objective functions. We …

We propose an algorithm to generate inner and outer polyhedral approximations to the
upper image of a bounded convex vector optimization problem. It is an outer approximation …

We present an algorithm for approximately solving bounded convex vector optimization
problems. The algorithm provides both an outer and an inner polyhedral approximation of …

This paper proposes a general framework for solving multiobjective nonconvex optimization
problems, ie, optimization problems in which multiple objective functions have to be …

This paper is concerned with solution algorithms for general convex vector optimization
problems (CVOPs). So far, solution concepts and approximation algorithms for solving …

In this paper, a parametric simplex algorithm for solving linear vector optimization problems
(LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex …

For a continuous multi-objective optimization problem, it is usually not a practical approach
to compute all its nondominated points because there are infinitely many of them. For this …