The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived. Some previous duality results for differentiable multiobjective programming problems turn out to be special cases for the results described in the paper.