Optimality conditions for approximate solutions of set-valued optimization problems in real linear spaces

Abstract

In this paper, we deal with optimization problems without assuming any topology. We study approximate efficiency and Q- Henig proper efficiency for the setvalued vector optimization problems, where Q is not necessarily convex. We use scalarization approaches based on nonconvex separation function to present some necessary and sufficient conditions for approximate (proper and weak) efficient solutions.