| Article ID: | iaor20091404 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 2 |
| Start Page Number: | 173 |
| End Page Number: | 176 |
| Publication Date: | Mar 2008 |
| Journal: | Operations Research Letters |
| Authors: | Popovici Nicolae |
The principal aim of this paper is to show that every weakly efficient solution of a lexicographic quasiconvex multicriteria optimization problem actually is an efficient (Pareto) solution of a reduced problem, obtained from the original one by selecting a certain number of criteria, not exceeding the Helly number of the solution space.