Involving the Helly number in Pareto reducibility |
| |
| Authors: | Nicolae Popovici |
| |
| Affiliation: | Faculty of Mathematics and Computer Science, Babe?-Bolyai University, 400084 Cluj-Napoca, Romania |
| |
| 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. |
| |
| Keywords: | Multicriteria optimization Lexicographic quasiconvex functions Pareto reducibility Helly number |
| 本文献已被 ScienceDirect 等数据库收录！ |
