Test Instances for Multiobjective Mixed-Integer Nonlinear Optimization

A suitable set of test instances, also known as benchmark problems, is a key ingredient to systematically evaluate numerical solution algorithms for a given class of optimization problems. While in recent years several solution algorithms for the class of multiobjective mixed-integer nonlinear optimization problems have been proposed, there is a lack of a well-established set … Read more

A Test Instance Generator for Multiobjective Mixed-integer Optimization

Application problems can often not be solved adequately by numerical algorithms as several difficulties might arise at the same time. When developing and improving algorithms which hopefully allow to handle those difficulties in the future, good test instances are required. These can then be used to detect the strengths and weaknesses of different algorithmic approaches. … Read more

Convexity and continuity of specific set-valued maps and their extremal value functions

In this paper, we study several classes of set-valued maps, which can be used in set-valued optimization and its applications, and their respective maximum and minimum value functions. The definitions of these maps are based on scalar-valued, vector-valued, and cone-valued maps. Moreover, we consider those extremal value functions which are obtained when optimizing linear functionals … Read more

On convexity and quasiconvexity of extremal value functions in set optimization

We study different classes of convex and quasiconvex set-valued maps defined by means of the lower-less order relation and the upper-less order relation. The aim of this paper is to formulate necessary and especially sufficient conditions for the convexity/quasiconvexity of extremal value functions. CitationDOI: 10.23952/asvao.3.2021.3.04ArticleDownload View PDF

On classes of set optimization problems which are reducible to vector optimization problems and its impact on numerical test instances

Set optimization with the set approach has recently gained increasing interest due to its practical relevance. In this problem class one studies optimization problems with a set-valued objective map and defines optimality based on a direct comparison of the images of the objective function, which are sets here. Meanwhile, in the literature a wide range … Read more

Characterization of properly optimal elements with variable ordering structures

In vector optimization with a variable ordering structure the partial ordering defined by a convex cone is replaced by a whole family of convex cones, one associated with each element of the space. In recent publications it was started to develop a comprehensive theory for these vector optimization problems. Thereby also notions of proper efficiency … Read more