Characterization of the Nonemptiness and Compactness of Solution Sets in Convex and Nonconvex Vector Optimization

As a consequence of an abstract theorem proved elsewhere, a vector Weierstrass theorem for the existence of a weakly efficient solution without any convexity assumption is established. By using the notion (recently introduced in an earlier paper) of semistrict quasiconvexity for vector functions and assuming additional structure on the space, new existence results encompassing many results appearing in the literature are derived. Also, when the cone defining the preference relation satisfies some mild assumptions (but including the polyhedral and icecream cones), 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.