Symmetric Duality for Multiobjective Nonlinear Programming Problem with Polarly C-invexity

A pair of symmetric dual problems in multiobjective nonlinear programming with cone constraints is formulated and the definitions of a class of polarly C-invex functions are introduced.Then under polarly C-invex assumptions,weak,strong and converse duality theorems for these problems are established by using the concept of weak efficiency and proper efficiency.