Publication: Computing the nadir point for multiobjective discrete optimization problems
Program
KU-Authors
KU Authors
Co-Authors
N/A
Publication Date
Language
Type
Embargo Status
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
We 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.
Source
Publisher
Springer
Subject
Operations research, Management science, Mathematics, Applied mathematics
Citation
Has Part
Source
Journal Of Global Optimization
Book Series Title
Edition
DOI
10.1007/s10898-014-0227-6