On nadir points of multiobjective integer programming problems |
| |
Authors: | Özgür Özpeynirci |
| |
Institution: | 1.Department of Logistics Management,?zmir University of Economics,Izmir,Turkey |
| |
Abstract: | In 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|