| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143410 | Operations Research Letters | 2006 | 7 Pages |
Abstract
The aim of this paper is to emphasize some remarkable properties of multicriteria optimization problems involving lexicographic quasiconvex objective functions. It is shown that, under appropriate assumptions, these problems are Pareto reducible and their efficient sets are strongly contractible.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nicolae Popovici,