| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142907 | Operations Research Letters | 2008 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nicolae Popovici,