Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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

This article is cited in 4 scientific papers (total 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.

Full text: PDF file (999 kB)

Bibliographic databases:
UDC: 519.6
Received: 16.01.1996
Revised: 07.04.1997

Citation: V. A. Emelichev, E. Girlikh, O. A. Yanushkevich, “Lexicographic optima of a multicriterial problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:2 (1997), 3–14

Citation in format AMSBIB
\Bibitem{EmeGirYan97}
\by V.~A.~Emelichev, E.~Girlikh, O.~A.~Yanushkevich
\paper Lexicographic optima of a~multicriterial problem
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1997
\vol 4
\issue 2
\pages 3--14
\mathnet{http://mi.mathnet.ru/da390}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1490445}


Linking options:
  • http://mi.mathnet.ru/eng/da390
  • http://mi.mathnet.ru/eng/da/v4/s1/i2/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. M. K. Kravtsov, O. A. Yanushkevich, “A linear convolution of criteria in bicriterial optimization”, Russian Math. (Iz. VUZ), 42:12 (1998), 60–66  mathnet  mathscinet  zmath
    2. Emelichev V.A., Yanushkevich O.A., “A linear criteria convolution in problems of lexicographic optimization”, Dokl Akad Nauk Belarusi, 43:2 (1999), 27–30  mathscinet  zmath  isi
    3. Yu. V. Bugaev, “Application of a direct generalization of scalar algorithms in vector optimization on graphs”, Discrete Math. Appl., 11:5 (2001), 445–460  mathnet  crossref  mathscinet  zmath
    4. A. V. Zykina, “A lexicographic optimization algorithm”, Autom. Remote Control, 65:3 (2004), 363–368  mathnet  crossref  mathscinet  zmath  isi
  • Дискретный анализ и исследование операций
    Number of views:
    This page:395
    Full text:152

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021