In this paper,the relationship between some genralized efficient solutions and generalized ε-efficient solutions for vector optimization problems(for short,VP)is investigated in real normed linear space.

In this paper,we provide a necessary condition for ε-efficient solutions of Multiobjective Programming(MOP),we mainly study six well-know scalarization methods for the MOP and establish the corresponding relationships between ε-efficient solutions and ε-optimal solutions when solving(MOP) and scalarized problem(SOP

in this paper,we define the generalized efficient solution and prove the existence of the generalized efficient solution for nondifferentiable vector optimization problems by using set-valued mapping vector quasi-variational inequalities.

In locally convex linear topological spaces,the ε-super efficient solution for vector optimization with set-valued maps was introduced.

In this paper,we study the connectedness of ε-super efficient solution set of vector optimization set-value mapping in normed linear spaces.

This paper establishes and proves the saddle points and duality theorems for ε-super efficient solution of vector optimization with set-valued maps, under the assumption that the set-valued maps is nearly generalized cone-subconvexlike, by utilizing the scalarization and Lagrange multiplier theorem for ε-super efficient solution.

In locally-convex topological vector spaces, ε-strict efficient points and ε-strict efficient solutions are introduced.