Duality for multiobjective variational control problems with (Φ,ρ)-invexity

In this paper, Mond-Weir and Wolfe type duals for multiobjective variational control problems are formulated. Several duality theorems are established relating efficient solutions of the primal and dual multiobjective variational control problems under TeX-invexity. The results generalize a number of duality results previously established for multiobjective variational control problems under other generalized convexity assumptions

Sufficient optimality criteria and duality for multiobjective variational control problems with G-type I objective and constraint functions

In the paper, we introduce the concepts of G-type I and generalized G-type I functions for a new class of nonconvex multiobjective variational control problems. For such nonconvex vector optimization problems, we prove sufficient optimality conditions for weakly efficiency, efficiency and properly efficiency under assumptions that the functions constituting them are G-type I and/or generalized G-type I objective and constraint functions. Further, for the considered multiobjective variational control problem, its dual multiobjective variational control problem is given and several duality results are established under (generalized) G-type I objective and constraint functions

Optimality and Duality for Nonsmooth Multiobjective Fractional Programming with Generalized Invexity

AbstractIn this paper, we consider a class of nonsmooth multiobjective fractional programming problems in which functions are locally Lipschitz. We establish generalized Karush–Kuhn–Tucker necessary and sufficient optimality conditions and derive duality theorems for nonsmooth multiobjective fractional programming problems containing V-ρ-invex functions

On nonsmooth multiobjective fractional programming problems involving (p, r)− ρ −(η ,θ)- invex functions

A class of multiobjective fractional programming problems (MFP) is considered where the involved functions are locally Lipschitz. In order to deduce our main results, we introduce the definition of (p,r)−ρ −(η,θ)-invex class about the Clarke generalized gradient. Under the above invexity assumption, sufficient conditions for optimality are given. Finally, three types of dual problems corresponding to (MFP) are formulated, and appropriate dual theorems are proved

Optimality and duality for generalized fractional programming involving nonsmooth (F, ρ)-convex functions

AbstractUsing a parametric approach, we establish necessary and sufficient conditions and derive duality theorems for a class of nonsmooth generalized minimax fractional programming problems containing (F, ρ)-convex function

On Minimax Fractional Optimality Conditions with Invexity

AbstractUnder different forms of invexity conditions, sufficient Kuhn–Tucker conditions and three dual models are presented for the minimax fractional programming

On Higher-order Duality in Nondifferentiable Minimax Fractional Programming

In this paper, we consider a nondifferentiable minimax fractional programming problem with continuously differentiable functions and formulated two types of higher-order dual models for such optimization problem.Weak, strong and strict converse duality theorems are derived under higherorder generalized invexity