Symmetric duality for multiobjective variational problems with invexity (Q1380308)

A pair of multiobjective nonlinear symmetric dual continuous programming problems are formulated. For the single objective case these problems become the symmetric dual pair of \textit{I. Smart} and \textit{B. Mond} [J. Math. Anal. Appl. 152, No. 2, 536-545 (1990; Zbl 0714.49039)]. Under invexity assumptions, weak, strong, converse, and self duality theorems are established for the pair of multiobjective problems, using the concept of efficient (Pareto) optimum. The static case of symmetric duality is deduced.