Özpeynirci, Özgür2023-06-162023-06-1620170925-50011573-2916https://doi.org/10.1007/s10898-017-0534-9https://hdl.handle.net/20.500.14365/926In this study, we consider the nadir points of multiobjective integer programming problems. We introduce new properties that restrict the possible locations of the nondominated points necessary for computing the nadir points. Based on these properties, we reduce the search space and propose an exact algorithm for finding the nadir point of multiobjective integer programming problems. We present an illustrative example on a three objective knapsack problem. We conduct computational experiments and compare the performances of two recent algorithms and the proposed algorithm.eninfo:eu-repo/semantics/closedAccessNadir pointMultiobjective integer programming problemExact algorithmAlgorithmValuesSetArticle10.1007/s10898-017-0534-92-s2.0-85019846312