The aim of this chapter is to propose some pairs of dual programs where the pri-
mal is a vector problem having a feasible region defined by a set constraint, equality
and inequality constraints, while the duals can be classified as \mixed type" ones.
The duality results are proved under suitable generalized concavity properties. In this
light, the role of dierent kinds of generalized concavity properties will be deepened on.
Keywords: Vector Optimization, Duality, Maximum Principle Conditions, Generalized
Convexity, Set Constraints.
