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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have