Optimality conditions and saddle-point theory for nonsmooth generalized convexity multiobjective programming

Abstract

In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution.