An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set

摘要

In this paper, we consider an optimization problem which aims to minimize a convex function over the weakly efficient set of a multiobjective programming problem. From a computational viewpoint, we may compromise our aim by getting an approximate solution of such a problem. To find an approximate solution, we propose an inner approximation method for such a problem. Furthermore, in order to enhance the efficiency of the solution method, we propose an inner approximation algorithm incorporating a branch and bound procedure.