In the present paper, we introduce a pair of multiobjective second-order symmetric variational control programs over cone constraints and derive weak, strong and converse duality theorems under second-order [Formula: see text]-convexity assumption. Moreover, self-duality theorem is also discussed. Our results extend some of the known results in literature.
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
Abstract. In this paper, we have taken step in the direction to establish weak, strong and strict converse duality theorems for three types of dual models related to multiojective fractional programming problems involving (Hp, r)-invex functions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.