On nadir points of multiobjective integer programming problems
| Autor: | Özgür Özpeynirci |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Mathematical optimization
021103 operations research Control and Optimization Applied Mathematics Computer Science::Neural and Evolutionary Computation MathematicsofComputing_NUMERICALANALYSIS 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Computer Science Applications Nadir point Exact algorithm restrict Knapsack problem 0202 electrical engineering electronic engineering information engineering Nadir 020201 artificial intelligence & image processing Integer programming Mathematics |
| Zdroj: | Journal of Global Optimization. 69:699-712 |
| ISSN: | 1573-2916 0925-5001 |
| DOI: | 10.1007/s10898-017-0534-9 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink