We present a new algorithm for optimizing a linear function over the set of efficient solutions of a multiobjective integer program MOIP. The algorithmâ€™s success relies on the efficiency of a new algorithm for enumerating the nondominated points of a MOIP, which is the result of employing a novel criterion space decomposition scheme which (1) limits the number of subspaces that are created, and (2) limits the number of sets of disjunctive constraints required to define the single-objective IP that searches a subspace for a nondominated point. A extensive computational study shows that the efficacy of the algorithm. Finally, we show that the algorithm can be easily modified to efficiently compute the nadir point of a multiobjective integer program.