Abstract
In this paper, three approaches given by Dinklebaeh (Manag Sci 13(7):492–498, 1967) and Jagannathan (Z Oper Res 17:618–630, 1968) for both primal and mixed type dual of a non differentiable multiobjective fractional programming problem in which the numerator of objective function contains square root of positive semi definite quadratic form are introduced. Also, the necessary and sufficient conditions of efficient solution for fractional programming are established and a parameterizations technique is used to established duality results under generalized ρ-univexity assumption.
Sign-in/Register to access full text options 
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 callMore From: Journal of Mathematical Modelling and Algorithms in Operations Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
