An approximation to the nondominated set of a multiobjective linear fractional programming problem. (2nd August 2016)

• Record Type: Journal Article
• Authors: Valipour, E.; Yaghoobi, M. A.; Mashinchi, M.
• Is Part Of: Optimization. Volume 65:Number 8(2016)
• Page Start: 1539
• Page End: 1552
• Publication Date: 2016-08-02
• Subjects: Multiobjective linear fractional programming -- iterative methods -- discrete approximation -- dispersion -- -approximation -- -efficient; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2016.1180387
• Languages: English
• ISSNs: 0233-1934

Abstract

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.