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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
