Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions