Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Matematicheskie Zametki, 1997, Volume 62, Issue 4, Pages 502–509
DOI: https://doi.org/10.4213/mzm1633
(Mi mzm1633)
 

This article is cited in 2 scientific papers (total 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
Full-text PDF (207 kB) Citations (2)
References:
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.
Received: 14.08.1995
English version:
Mathematical Notes, 1997, Volume 62, Issue 4, Pages 420–425
DOI: https://doi.org/10.1007/BF02358974
Bibliographic databases:
UDC: 519.10
Language: Russian
Citation: M. K. Kravtsov, O. A. Yanushkevich, “Solvability of the vector problem by the linear criteria convolution algorithm”, Mat. Zametki, 62:4 (1997), 502–509; Math. Notes, 62:4 (1997), 420–425
Citation in format AMSBIB
\Bibitem{KraYan97}
\by M.~K.~Kravtsov, O.~A.~Yanushkevich
\paper Solvability of the vector problem by the linear criteria convolution algorithm
\jour Mat. Zametki
\yr 1997
\vol 62
\issue 4
\pages 502--509
\mathnet{http://mi.mathnet.ru/mzm1633}
\crossref{https://doi.org/10.4213/mzm1633}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1620134}
\zmath{https://zbmath.org/?q=an:0915.90229}
\transl
\jour Math. Notes
\yr 1997
\vol 62
\issue 4
\pages 420--425
\crossref{https://doi.org/10.1007/BF02358974}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000072500900021}
Linking options:
  • https://www.mathnet.ru/eng/mzm1633
  • https://doi.org/10.4213/mzm1633
  • https://www.mathnet.ru/eng/mzm/v62/i4/p502
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:396
    Full-text PDF :203
    References:62
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024