J Austral Math Soc Ser B 38 pp140--148, 1996.
(Received ; revised )
We extend the concept of V-psuedo-invexity of multi-objective programming to the case of nonsmooth multi-objective programming problems. The generalised subgradient Kuhn-Tucher conditions are shown to be sufficient for a weak minimum of a multi-objective programming problem under certain assumptions. Duality results are also obtained.
Last Modified: Mon Dec 10 14:02:16 2001