Abstract: This paper discussed a class of nondifferential multiobjective progr-amming problem，each goal function of which is a sum of differentiable function and a square root of quadratic forms.Under conditions of convex, the author established optimality conditions and weak, strong, and conversa duality theorems.

Key words: Multijective programming Optimality condition C