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.
Highlights
Semi-infinite multi-objective programming consider several conflicting objective functions have to be optimized over a feasible set described by infinite number of inequality constraints
Optimality and duality results for semi-infinite multi-objective programming problems that involved differentiable functions were obtained by Caristi et al [11]
Several kinds of constraints qualifications were defined by Kanzi and Nobakhtian [12] and they obtained necessary and sufficient optimality conditions for nonsmooth semiinfinite multi-objective programming problems
Summary
Semi-infinite multi-objective programming consider several conflicting objective functions have to be optimized over a feasible set described by infinite number of inequality constraints. Optimality and duality results for semi-infinite multi-objective programming problems that involved differentiable functions were obtained by Caristi et al [11]. Mishra et al [13] proved necessary and sufficient optimality conditions for nondifferential semi-infinite programming problems involving square root of quadratic functions, for more details see [14]. Optimality and duality for a nondifferentiable nonlinear programming problem involving support function have been obtained by Husain et al [16], see for more details [17,18,19,20].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
