Nondifferentiable multiobjective semi-infinite programming problems under higher-order convexity

The present paper is framed to focus on a nondifferentiable multiobjective semi-infinite programming problem and to establish sufficient optimality conditions from the standpoint of higher-order convexity and Clarke’s subdifferentials assumptions. These optimality conditions are illustrated by a nontrivial example. Subsequently, weak, strong and strict converse duality theorems are established in order to relate the strict minimizer (maximizer) of order m of primal and mixed type multiobjective dual model.