A method for finding the set of non-dominated vectors for multiple objective integer linear programs

An algorithm for enumerating all non-dominated vectors of multiple objective integer linear programs is presented. Using a straightforward theoretical approach, the problem is solved using a sequence of progressively more constrained integer linear programs generating a new solution at each step. The algorithm can also give subsets of efficient solutions that can be useful for designing interactive procedures for large, real-life problems.