Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482481 | European Journal of Operational Research | 2006 | 22 Pages |
Abstract
In this paper, a method for optimizing a linear function over the integer Pareto-optimal set without having to determine all integer efficient solutions is presented. The proposed algorithm is based on a simple selection technique that improves the linear objective value at each iteration. Two types of cuts are performed successively until the optimal value is obtained and the current truncated region contains no integer feasible solution.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Moncef Abbas, Djamal Chaabane,