An Extention of Benson’s Algorithm for Multiobjective Optimization Problems

We propose an extension of Benson s approximation algorithm for a class of nonconvex multiobjective optimization problems. This method construct an inner approximation and an outer approximation in the objective space without requiring any continuity and compactness assumptions to solve multiobjective optimization problem. Moreover, we provide a numerical example to illustrate the advantage of our algorithm.