Arcwise cone-quasiconvex multicriteria optimization

The aim of this paper is to study the structure of the efficient sets within a special class of multicriteria optimization problems, involving objective functions which are continuous and arcwise quasiconvex with respect to a certain family of cones. In particular, it is shown that such a problem is Pareto reducible and its efficient outcome set is strongly contractible.