Vector discrete problems: parametrization of an optimality principle and conditions of solvability in the class of algorithms involving linear convolution of criteria
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. Suff...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2001-02-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v8-n3/v8-n3-(pp260-269).pdf |