An approximation to the nondominated set of a multiobjective linear fractional programming problem

作者：Valipour E^*; Yaghoobi M A; Mashinchi M

来源：Optimization, 2016, 65(8): 1539-1552.

DOI：10.1080/02331934.2016.1180387

• Multiobjective linear fractional programming
• iterative methods
• discrete approximation
• dispersion
• epsilon-approximation
• epsilon-efficient

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 eapproximation to the nondominated set, where epsilon 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 delta(0) and hence there is no redundant information. Also, for a given upper bound the method controls the cardinality of the resulting approximation set.

• 出版日期2016