Duality for multiobjective programming involving n-set functions

Abstract

We formulate the Wolfe, Mond-Weir and generalized Mond-Weir types of dual problems for a multiobjective program involving vector valued n-set functions. By using the concept of efficiency (Pareto optimum) we prove the weak and strong duality theorems for a multiobjective program under generalized ρ-convexity assumptions.

Keywords:

• Efficient Solutions (Pareto Optimum)
• Generalized ρ-Convexity
• n-Set Functions
• Multiobjective Programs
• Optimality Conditions
• Duality Theorems