An approximate strong KKT condition for multiobjective optimization

摘要: In this paper, we introduce a sequential approximate strong Karush–Kuhn–Tucker (ASKKT) condition for multiobjective optimization problem with inequality constraints. We show that each local efficient solution satisfies the ASKKT condition, but weakly solutions may not satisfy it. Subsequently, use so-called cone-continuity regularity (CCR) to guarantee limit of an sequence converges SKKT point. Finally, under appropriate assumptions, is also sufficient properly points convex problems.