RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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., 2010, Volume 17, Number 3, Pages 32–45 (Mi da610)  

This article is cited in 5 scientific papers (total in 5 papers)

On quasistability of the lexicographic minimax combinatorial problem with decomposing variables

V. A. Emelicheva, A. V. Karpukb, K. G. Kuzmina

a Belarusian State University, Minsk, Belarus
b BPS-Bank, Minsk, Belarus

Abstract: A multicriteria combinatorial sequential optimization problem with minimax criteria is considered. We obtained the formula for the limit level of the vector criteria parameters perturbations, for which all lexicographic optima of the initial problem are preserved. Bibl. 21.

Keywords: minimax problem, bottleneck problem, multi-objectiveness, sequential optimization, lexicographic set, lexicographic optimum, quasistability, quasistability radius.

Full text: PDF file (279 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.8
Received: 23.10.2009

Citation: V. A. Emelichev, A. V. Karpuk, K. G. Kuzmin, “On quasistability of the lexicographic minimax combinatorial problem with decomposing variables”, Diskretn. Anal. Issled. Oper., 17:3 (2010), 32–45

Citation in format AMSBIB
\Bibitem{EmeKarKuz10}
\by V.~A.~Emelichev, A.~V.~Karpuk, K.~G.~Kuzmin
\paper On quasistability of the lexicographic minimax combinatorial problem with decomposing variables
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 3
\pages 32--45
\mathnet{http://mi.mathnet.ru/da610}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2732272}
\zmath{https://zbmath.org/?q=an:1249.90219}


Linking options:
  • http://mi.mathnet.ru/eng/da610
  • http://mi.mathnet.ru/eng/da/v17/i3/p32

    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. V. A. Emelichev, V. V. Korotkov, “Otsenki radiusa ustoichivosti leksikograficheskogo optimuma vektornoi bulevoi zadachi s kriteriyami riskov Sevidzha”, Diskretn. analiz i issled. oper., 18:2 (2011), 41–50  mathnet  mathscinet  zmath
    2. V. A. Emelichev, V. V. Korotkov, “O radiuse ustoichivosti effektivnogo resheniya vektornoi kvadratichnoi bulevoi zadachi na uzkie mesta”, Diskretn. analiz i issled. oper., 18:6 (2011), 3–16  mathnet  mathscinet  zmath
    3. V. A. Emelichev, V. V. Korotkov, “Ob ustoichivosti leksikograficheskogo resheniya vektornoi minimaksnoi kvadratichnoi bulevoi zadachi”, Tr. In-ta matem., 19:2 (2011), 26–36  mathnet
    4. V. A. Emelichev, V. V. Korotkov, “Ustoichivost leksikograficheskoi investitsionnoi zadachi s maksiminnymi kriteriyami Valda”, Tr. In-ta matem., 20:1 (2012), 33–41  mathnet
    5. V. A. Emelichev, K. G. Kuzmin, “Analiz ustoichivosti effektivnogo resheniya vektornoi zadachi o maksimalnom razreze grafa”, Diskretn. analiz i issled. oper., 20:4 (2013), 27–35  mathnet  mathscinet
  • Дискретный анализ и исследование операций
    Number of views:
    This page:403
    Full text:69
    References:41
    First page:5

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020