Abstract

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.

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