Optimality and duality for nonsmooth semi-infinite E-convex multi-objective programming with support functions

Abstract

In this paper, we study a nonsmooth semi-infinite multi-objective E-convex programming problem involving support functions. We derive sufficient optimality conditions for the primal problem. We formulate Mond-Weir type dual for the primal problem and establish weak and strong duality theorems under various generalized E-convexity assumptions.