Abstract
This paper presents a method for approximating the nondominated set of a multiobjective linear fractional programming (MOLFP) problem. The resulting approximation set has acceptable quality measures, and is an -approximation to the nondominated set, where is the tolerance vector and can be controlled by the decision-maker. The distance between every two resulting solutions is greater than or equal to a positive value and hence there is no redundant information. Also, for a given upper bound the method controls the cardinality of the resulting approximation set.
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.
