Abstract: In this paper, we first characterize the nonemptiness and boundedness of the efficient solution set of a cone-constrained convex vector optimization problem whose domination cone is  polyhedral.  Then, we apply a key condition in the characterizations to the convergence analysis of a class of penalty methods.