Abstract
In this paper, we consider nondifferentiable multiobjective fractional programming problems. A concept of generalized convexity, which is called (C,α,ρ,d)-convexity, is first discussed. Based on this generalized convexity, we obtain efficiency conditions for multiobjective fractional programming (MFP). Furthermore, we establish duality results for three types of dual problems of (MFP) and present the corresponding duality theorems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have