| Article ID: | iaor20062301 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 2 |
| Start Page Number: | 149 |
| End Page Number: | 154 |
| Publication Date: | Mar 2006 |
| Journal: | Operations Research Letters |
| Authors: | Popovici Nicolae |
| Keywords: | cutting plane algorithms |
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.