Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
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
– 0.14 Mb
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:
Belorussian State University
ave. F.Skoriny, 4,
Minsk 220050 Belarus
e-mail:
Fulltext
– 0.14 Mb
Contents
- A set-theoretic approach to linguistic feature structures and unification algorithms (II)
- On Planar Mixed Hypergraphs
- Vector discrete problems: parametrization of an optimality principle and conditions of solvability in the class of algorithms involving linear convolution of criteria
- Fast block ciphers based on controlled permutations
- The Parallel Algorithms for a Correlation Function Computing
- Technical efficiency in Moldavian industry
- Post-graduate Studies in Mathematics and Computer Science Proposed by the Institute of Mathematics and Computer Science of the Academy of Sciences of the Republic of Moldova
- Abstracts of Dr. Theses
