Ramu Dubey, Vishnu Narayan Mishra
The motivation behind this article is to study a class of nondifferentiable multiobjective fractional programming problem in which each component of objective functions contains a term including the support function of a compact convex set. For a differentiable function, we consider a class of higher order pseudo quasi/ strictly pseudo quasi/weak strictly pseudo quasi- (V, ρ, d)-type-I convex functions. Under these the higher-order pseudo quasi/ strictly pseudo quasi/weak strictly pseudo quasi- (V, ρ, d)-type-I convexity assumptions, we prove the higher-order weak, higher-order strong and higher-order converse duality theorems related to efficient solution.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados