Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2007, Volume 19, Issue 2, Pages 45–50
DOI: https://doi.org/10.4213/dm18 (Mi dm18) 		 
This article is cited in 3 scientific papers (total in 3 papers)

On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions

E. Gurevsky, V. A. Emelichev
Full-text PDF (95 kB) Citations (3) English version article
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm18
Abstract: We consider a vector (multicriteria) problem of Boolean programming in the case where the partial criteria are the absolute values of linear functions. We study the limit level of disturbances of the coefficients of criterion functions in the space with metrics $l_\infty$ which preserves the Pareto optimality of the solution. We obtain a necessary and sufficient condition for the stability radius of such a solution to be infinite.
Received: 15.12.2005
Revised: 25.01.2006
English version:
Discrete Mathematics and Applications, 2007, Volume 17, Issue 3, Pages 231–236
DOI: https://doi.org/10.1515/dma.2007.018
Bibliographic databases:
UDC: 519.8
Language: Russian
Citation: E. Gurevsky, V. A. Emelichev, “On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions”, Diskr. Mat., 19:2 (2007), 45–50; Discrete Math. Appl., 17:3 (2007), 231–236
Citation in format AMSBIB
\Bibitem{GurEme07}
\by E.~Gurevsky, V.~A.~Emelichev
\paper On stability of an efficient solution of a~vector Boolean problem of maximisation of absolute values of linear functions
\jour Diskr. Mat.
\yr 2007
\vol 19
\issue 2
\pages 45--50
\mathnet{http://mi.mathnet.ru/dm18}
\crossref{https://doi.org/10.4213/dm18}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2357156}
\zmath{https://zbmath.org/?q=an:05233539}
\elib{https://elibrary.ru/item.asp?id=9577325}
\transl
\jour Discrete Math. Appl.
\yr 2007
\vol 17
\issue 3
\pages 231--236
\crossref{https://doi.org/10.1515/dma.2007.018}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34547678135}
Linking options:
  • https://www.mathnet.ru/eng/dm18
  • https://doi.org/10.4213/dm18
  • https://www.mathnet.ru/eng/dm/v19/i2/p45
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:823
    Full-text PDF :320
    References:173
    First page:10
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026