Duality in convex vector optimization

The paper considers a fairly general minimization problem in convex vector optimization. It defines and studies its dual and obtain as special cases, many existing results on the matter. Isermann’s main duality result in the linear case will be improved. For working tools, the paper generalizes several results used in convex scalar optimization to the vector case. On the way, it shows that a result on duality and alternative in multiobjective optimization needs not satisfy the hypothesis of the domination property to hold.