RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.8, n.3 (24), 2000/

Vector discrete problems: parametrization of an optimality principle and conditions of solvability in the class of algorithms involving linear convolution of criteria

Authors: V.A.Emelichev, A.V.Pashkevich

Abstract

An n-criteria problem with a finite set of vector valuations is considered. An optimality principle of this problem is given by an integer-valued parameter s, which is varied from 1 to n-1. At that, the majority and Pareto optimality principles correspond to the extreme values of the parameter. Sufficient conditions, under which the problem of finding efficient valuations corresponding to the parameter s is solvable by the linear convolution of criteria, are indicated.

V.A.Emelichev, A.V.Pashkevich,
Belorussian State University
ave. F.Skoriny, 4,
Minsk 220050 Belarus
e-mail:



Fulltext

Adobe PDF document0.14 Mb