Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems

摘要

In this paper, we characterize approximate Benson-proper solutions of a constrained vector optimization problem with generalized cone convexity assumptions through approximate solutions of associated scalar optimization problems and also via approximate proper saddle point theorems. These results are based on an approximate version of the well known nearly subconvexlikeness notion and also on a new set-valued Lagrangian and a new concept of approximate proper saddle point.