d–ρ–(η,θ)d–ρ–(η,θ)-invexity in multiobjective optimization

In this paper, a generalization of convexity is considered in the case of multiobjective optimization problems, where the functions involved are non-differentiable. Under d–ρ–(η,θ)d–ρ–(η,θ)-invexity assumptions on the functions involved, weak, strong and converse duality results are proved to relate weak Pareto (efficient) solutions of the multiobjective programming problems (PVP), (DVP) and (MWD). We have also established the Karush–Kuhn–Tucker sufficient optimality condition.