摘要

In general Banach spaces, we consider a vector optimization problem (SVOP) in which the objective is a set-valued mapping whose graph is the union of finitely many polyhedra. We establish some results on structure and connectedness of the weak Pareto solution set, Pareto solution set, weak Pareto optimal value set and Pareto optimal value set of (SVOP). In particular, we improve and generalize Arrow, Barankin and Blackwell's classical results on linear vector optimization problems in Euclidean spaces.