DUALITY IN CONVEX VECTOR OPTIMIZATION

We consider a fairly general minimization problem in convex vector opt imization. We define and study its dual and obtain as special cases, m any existing results on the matter. Isermann's main duality result in the linear case will be improved. For working tools, we generalize sev eral results used in convex scalar optimization to the vector case. On the way, we show that a result on duality and alternative in multiobj ective optimization needs not satisfy the hypothesis of the domination property to hold.