Abstract
Abstract In this paper we consider non-linear nondifferentiable multiobjective fractional programming problem in which numerator of each component of the objective function contains a term involving square root of a certain positive semi-definite quadratic form. Necessary and sufficient conditions for a feasible point to be properly efficient are established. A dual is also formulated. Weak and Strong duality theorems are given in the framework of Hanson-Mond classes of functions.
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 callDisclaimer: 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.
