Exponentially E − [0,1] convex multi-objective programming problems

In this paper, we define a new class of functions as a generalization of exponentially convex functions, called exponentially [Formula: see text] convex and exponentially generalized [Formula: see text] convex functions and discuss their properties. After that, we are interested in deriving the sufficient and necessary conditions of optimality for nonlinear programming involving these functions. The Mond–Weir-type dual problem is considered under the exponentially [Formula: see text] convexity assumption and its results are generalized. Characterization of efficient solutions for exponentially [Formula: see text] convex multi-objective programming is obtained. Finally, sufficient and necessary conditions for a feasible solution to be an efficient solution for these multi-objective problems are derived.