Efficiency and generalized concavity for multi-objective set-valued programming

The purpose of this paper is to give sufficient conditions of generalized concavity type for a local (weakly) efficient solution to be a global (weakly) efficient solution for a vector maximization set-valued programming problem. In the particular case of the vector maximization set-valued fractional programming problem, we derive some characterizations properties of efficient and properly efficient solutions based on a parametric procedure associated to the fractional problem