Duality in nondifferentiable minimax fractional programming with B-(p, r)-invexity

Duality in nondifferentiable minimax fractional programming with B-(p, r)-invexity

Blog Article

Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming problem.We Buddy Stirrups derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under B-(p, r)-invexity assumptions.Examples are given to show that B-(p, r)-invex functions are generalization of (p, r)-invex and convex functions AMS Subject Classification: 90C32; Crib Mattress 90C46; 49J35.