Department of Business Administration2024-11-0920150925-500110.1007/s10898-014-0227-62-s2.0-84938200114http://dx.doi.org/10.1007/s10898-014-0227-6https://hdl.handle.net/20.500.14288/6664We investigate the problem of finding the nadir point for multiobjective discrete optimization problems (MODO). The nadir point is constructed from the worst objective values over the efficient set of a multiobjective optimization problem. We present a new algorithm to compute nadir values for MODO with objective functions. The proposed algorithm is based on an exhaustive search of the -dimensional space for each component of the nadir point. We compare our algorithm with two earlier studies from the literature. We give numerical results for all algorithms on multiobjective knapsack, assignment and integer linear programming problems. Our algorithm is able to obtain the nadir point for relatively large problem instances with up to five-objectives.Operations researchManagement scienceMathematicsApplied mathematicsJournal Article1573-29163530474000044798