AN APPROACH TO SOLVING DISCRETE VECTOR OPTIMIZATION PROBLEMS OVER A COMBINATORIAL SET OF PERMUTATIONS

摘要

Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some properties of an admissible domain for a combinatorial multicriteria problem embedded into an arithmetic Euclidian space are considered. Optimality conditions are obtained for different types of effective solutions. A new approach to solving the problems formulated is constructed and substantiated.