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

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

0.00 Avg rating0 Votes
Article ID: iaor20021977
Country: Netherlands
Volume: 133
Issue: 2
Start Page Number: 267
End Page Number: 286
Publication Date: Sep 2001
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: branch and bound
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.