Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
From the abstract: By using the notion of semistrict quasiconvexity for vector functions and assuming additional structure on the space, new existence results are derived. When the cone defining the preference relation satisfies some mild assumptions, various characterizations for the nonemptiness and compactness of the weakly efficient solution set to convex vector optimization problems are given. Similar results for a class of nonconvex problems on the real line are established as well.
scientific article; zbMATH DE number 5131145