Institute of Information Theories and Applications FOI ITHEA
Abstract
The paper considers vector discrete optimization problem with linear fractional functions of criteria on a
feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain
and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between
vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is
determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear-
fractional functions of criteria on a set of combinations
