{"references": ["", "M. Hanson, On sufficiency of the Kuhn-Tucker conditions, J. Math. Anal.\nAppl., 80 (1981) 545-550.", "B. Craven, Nondifferential optimization by nonsmooth approximations,\nOptimization, 17 (1986) 3-17.", "T. Reiland, Nonsmooth invexity, Bull. Austral. Math. Soc., 42 (1990)\n437-446.", "D. Martin, The essence of invexity, J. Optim. Th. Appl., 47 (1986) 65-76.", "B. Mond, S. Chandra, I. Husain, Duality for variational problems with\ninvexity, J. Math. Anal. Appl., 134 (1988) 322-328.", "F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York,\n1983.", "F. H. Clarke, Nonsmooth Analysis and Control Theory, Berlin: Springer-\nVerlag, 1998.", "M. Arana-Jim\u00b4enez, R. Osuna-G\u00b4omez, G. Ruiz-Garz\u00b4on, M. Rojas-Medar,\nOn variational problems: Characterization of solutions and duality, J.\nMath. Anal. Appl., 311 (2005) 1-12.", "S. K. Suneja, S. Khurana, Vani, Generalized nonsmooth invexity over\ncones in vector optimization, European Journal of Operational Research,\n186 (2008) 28-40.\n[10] C. Bector, S. Chandra, I. Husain, Generalized concavity and duality in\ncontinuous programming, Util. Math., 25 (1984) 171-190.\n[11] N. Yen, P. Sach, On locally Lipschitz vector valued invex functions,\nBull. Austral. Math. Soc., 47 (1993) 259-271.\n[12] M. Hanson, B. Mond, Necessary and sufficient conditions in constrainted\noptimization, Math. Programming, 37 (1987) 51-58.\n[13] M. Hanson, Invexity and the Kuhn-Tucker theorem, J. Math. Anal.\nAppl., 236 (1999) 594-604.\n[14] B. Craven, X. Yang, A nonsmooth version of alternative theorem and\nnonsmooth multiobjective programming, Utilitas Mathematica, 40 (1991)\n117-128.\n[15] M. Bazaraa, C. Shetty, Nonlinear Programming: Theory and Algorithms,\nWiley, New York, 1979."]}

In this paper, we introduce a new class of nonsmooth pseudo-invex and nonsmooth quasi-invex functions to non-smooth variational problems. By using these concepts, numbers of necessary and sufficient conditions are established for a nonsmooth variational problem wherein Clarke’s generalized gradient is used. Also, weak, strong and converse duality are established.