Symmetric Duality for Multiobjective Variational Problems

A Mond]Weir type symmetric dual for a multiobjective variational problem is formulated. Weak and strong duality theorems under generalized convexity assumptions are proved for properly efficient solutions. Under an additional condition on the kernel function that occurs in the formulation of the problems, a self duality theorem is proved. A close relationship between these variational problems and symmetric dual nonlinear multiobjective programming problems is also incor - porated.