Some properties of approximate solutions for vector optimization problem with set-valued functions

In this paper, we study the approximate solutions for vector optimization problem with set-valued functions. The scalar characterization is derived without imposing any convexity assumption on the objective functions. The relationships between approximate solutions and weak efficient solutions are discussed. In particular, we prove the connectedness of the set of approximate solutions under the condition that the objective functions are quasiconvex set-valued functions.