Involving the Helly number in Pareto reducibility

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.