Conjugate duality in set-valued Vector optimization

Abstract

In this paper, conjugate duality results for convexlike set-valued vector optimization problems are presented under closedness or boundedness hypotheses. Some properties of the value mapping of a set-valued vector optimization problem are studied. A conjugate duality result is also proved for a convex set-valued vector optimization problem without the requirements of closedness and boundedness. © 1997 Academic Press.