An Algorithm for Vector Optimization Problems

In this paper, we consider of finding efficient solution and weakly efficient solution for nonconvex vector optimization problems. When X and Y are normed spaces, F is an anti-Lipschitz mapping from X to Y, and the ordering cone is regular, we present an algorithm to guarantee that the generated sequence converges to an efficient solution with respect to normed topology. If the domain of the mapping is compact, we prove that the generated sequence converges to an efficient solution with respect to normed topology without requiring that mapping is anti-Lipschitz. We also give an algorithm to guarantee that the generated sequence converges to a weakly efficient solution with respect to normed topology.