RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., Ser. 1, 1997 Volume 4, Issue 2, Pages 3–14 (Mi da390)

This article is cited in 4 papers

Lexicographic optima of a multicriterial problem

V. A. Emelicheva, E. Girlikhb, O. A. Yanushkevichc

a Belarusian State University
b Otto-von-Guericke-Universität Magdeburg
c Institute of Technical Cybernetics, National Academy of Sciences of Belarus

Abstract: We study the solvability of the problem of searching for the lexicographic set of a vector (multicriterial) optimization problem in the class of algorithms of the linear convolution of criteria. We find necessary as well as sufficient conditions for such solvability. For the case of a two-criterion problem, we give a condition that is both necessary and sufficient for solvability.

UDC: 519.6

Received: 16.01.1996
Revised: 07.04.1997



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025