Multiobjective duality with ρ−(η,θ)-invexity

Abstract

Under ρ−(η,θ)-invexity assumptions on the functions involved, weak, strong, and converse duality theorems are proved to relate properly efficient solutions of the primal and dual problems for a multiobjective programming problem.