Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions

Abstract

In this paper, we consider a nonsmooth semi-infinite multiobjective programming problem involving support functions. We establish sufficient optimality conditions for the primal problem. We formulate Mond-Weir type dual for the primal problem and establish weak, strong and strict converse duality theorems under various generalized convexity assumptions. Moreover, some special cases of our problem and results are presented.

Keywords

• nonsmooth semi-infinite multiobjective optimization
• generalized convexity
• duality