Abstract

In this article, a pair of G-Wolfe-type fractional programming problems is formulated. For a differentiable function, we consider the definitions of G-invexity/G-psedoinvexity, which extends some kinds of generalized convexity assumptions. In the next section, we prove the weak, strong and converse duality theorems under G-invexity/G-psedoinvexity assumptions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call