RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive

Mat. Zametki, 1997 Volume 62, Issue 4, Pages 502–509 (Mi mzm1633)

This article is cited 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.

UDC: 519.10

Received: 14.08.1995

DOI: 10.4213/mzm1633


 English version:
Mathematical Notes, 1997, 62:4, 420–425

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025