Global Connecting Dual Representation of Non-Smooth Multi-Objective Programs using Convex Functions

New classes of vector functions ,namely V-( , , )- pseudo convex and V- ( , , )- quasi convex functions are introduced which are weaker than V-( , , )- convex functions. Sufficient optimality conditions for proper potency and numerous duality theorems for a category of nonsmooth multiobjective programs are obtained under the assumptions of the above said functions.