|
This article is cited in 2 scientific papers (total in 2 papers)
Solvability of the vector problem by the linear criteria convolution algorithm
M. K. Kravtsova, O. A. Yanushkevichb a Belarusian Research Institute of Economics and Informatics, Belarus Academy of Agrarian Sciences
b Institute of Technical Cybernetics, National Academy of Sciences of Belarus
Abstract:
Conditions are found under which a multicriteria problem with a finite set of vector estimates is solvable by means of the linear criteria convolution (LCC) algorithm, that is, any Pareto optimum for the problem can be obtained as an optimum solution to a one-criterion problem with an aggregated criterion defined as an LCC. Also, an algorithm is suggested that is polynomial in dimension and reduces any problem with minimax and minimun criteria to an equivalent vector problem with the same Pareto set solvable by the LCC algorithm.
Received: 14.08.1995
Citation:
M. K. Kravtsov, O. A. Yanushkevich, “Solvability of the vector problem by the linear criteria convolution algorithm”, Mat. Zametki, 62:4 (1997), 502–509; Math. Notes, 62:4 (1997), 420–425
Linking options:
https://www.mathnet.ru/eng/mzm1633https://doi.org/10.4213/mzm1633 https://www.mathnet.ru/eng/mzm/v62/i4/p502
|
Statistics & downloads: |
Abstract page: | 396 | Full-text PDF : | 203 | References: | 62 | First page: | 1 |
|