On generalised convex multi-objective nonsmooth programming

Abstract

We extend the concept of V-pseudo-invexity and V-quasi-invexity of multi-objective programming to the case of nonsmooth multi-objective programming problems. The generalised subgradient Kuhn-Tucker conditions are shown to be sufficient for a weak minimum of a multi-objective programming problem under certain assumptions. Duality results are also obtained.