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 linearfractional functions of criteria on a set of combinations.

Keywords: vector optimization, discrete optimization, linear fractional functions, set of combinations.

ACM Classification Keywords: G 2.1 Combinatorics (F2.2), G 1.6 Optimization

Link:

VECTOR COMBINATORIAL PROBLEMS IN A SPACE OF COMBINATIONS WITH LINEAR FRACTIONAL FUNCTIONS OF CRITERIA

Natalia Semenova, Lyudmyla Kolechkina, Alla Nagirna

http://www.foibg.com/ijita/vol15/ijita15-3-p07.pdf