Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483079 | European Journal of Operational Research | 2007 | 17 Pages |
Abstract
We present an algorithm for generating a subset of non-dominated vectors of multiple objective mixed integer linear programming. Starting from an initial non-dominated vector, the procedure finds at each iteration a new one that maximizes the infinity-norm distance from the set dominated by the previously found solutions. When all variables are integer, it can generate the whole set of non-dominated vectors.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
John Sylva, Alejandro Crema,