<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mireabulletin</journal-id><journal-title-group><journal-title xml:lang="ru">Russian Technological Journal</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Technological Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2782-3210</issn><issn pub-type="epub">2500-316X</issn><publisher><publisher-name>RTU MIREA</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.32362/2500-316X-2023-11-2-84-91</article-id><article-id custom-type="elpub" pub-id-type="custom">mireabulletin-657</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИЧЕСКОЕ МОДЕЛИРОВАНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICAL MODELING</subject></subj-group></article-categories><title-group><article-title>Экстремум в задаче о парных сравнениях</article-title><trans-title-group xml:lang="en"><trans-title>Extremum in the problem of paired comparisons</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-5907-2151</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Пулькин</surname><given-names>И. С.</given-names></name><name name-style="western" xml:lang="en"><surname>Pulkin</surname><given-names>I. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Пулькин Игорь Сергеевич, кандидат физико-математических наук, доцент кафедры высшей математики Института искусственного интеллекта</p><p>119454, Москва, пр-т Вернадского, д. 78</p></bio><bio xml:lang="en"><p>Igor S. Pulkin, Cand. Sci. (Phys.-Math.), Associate Professor, Higher Mathematics Department, Institute of Artificial Intelligence</p><p>78, Vernadskogo pr., Moscow, 119454</p></bio><email xlink:type="simple">pulkin@mirea.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-2969-8740</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Татаринцев</surname><given-names>А. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Tatarintsev</surname><given-names>A. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Татаринцев Андрей Владимирович, кандидат физико-математических наук, доцент кафедры высшей математики и программирования Института перспективных технологий и индустриального программирования</p><p>Scopus Author ID 57221996001, 7004076246</p><p>119454, Москва, пр-т Вернадского, д. 78</p></bio><bio xml:lang="en"><p>Andrey V. Tatarintsev, Cand. Sci. (Phys.-Math.), Associate Professor, Department of Higher Mathematics and Programming, Institute of Advanced Technologies and Industrial Programming</p><p>Scopus Author ID 57221996001, 7004076246</p><p>78, Vernadskogo pr., Moscow, 119454</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">МИРЭА – Российский технологический университет<country>Россия</country></aff><aff xml:lang="en">MIREA – Russian Technological University<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>09</day><month>04</month><year>2023</year></pub-date><volume>11</volume><issue>2</issue><fpage>84</fpage><lpage>91</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Пулькин И.С., Татаринцев А.В., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Пулькин И.С., Татаринцев А.В.</copyright-holder><copyright-holder xml:lang="en">Pulkin I.S., Tatarintsev A.V.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.rtj-mirea.ru/jour/article/view/657">https://www.rtj-mirea.ru/jour/article/view/657</self-uri><abstract><sec><title>Цели</title><p>Цели. Рассмотрена задача оценки альтернатив на основе результатов экспертных парных сравнений. Важность и актуальность этой задачи обусловлены ее многочисленными применениями в самых разных областях – как в технических и естественных, так и в гуманитарных, от строительства до политики. Ставится задача вычисления вектора объективных рейтингов на основе экспертных оценок. В математической формулировке задача нахождения вектора объективных рейтингов сводится к аппроксимации матриц парных сравнений согласованными матрицами.</p></sec><sec><title>Методы</title><p>Методы. Используются аналитические методы анализа и высшей алгебры. Для некоторых частных случаев приведены результаты численных расчетов.</p></sec><sec><title>Результаты</title><p>Результаты. В работе доказана теорема, утверждающая, что согласованная матрица, наилучшим образом аппроксимирующая заданную обратно-симметрическую матрицу в лог-евклидовой метрике, всегда существует и единственна. Кроме того, выведены формулы для вычисления такой согласованной матрицы. Для малых размерностей рассматриваются примеры, позволяющие сравнить результаты, полученные по выведенной формуле, с результатами для других известных способов нахождения согласованной матрицы – для вычисления собственного вектора и для минимизации невязки в лог-чебышевской метрике. Доказано, что в размерности 3 все эти способы приводят к одному и тому же результату, а уже в размерности 4 все результаты различны.</p></sec><sec><title>Выводы</title><p>Выводы. Полученные в статье результаты позволяют вычислять вектор объективных рейтингов по данным экспертной оценки. Этот метод может быть использован в стратегическом планировании в тех случаях, когда выводы и рекомендации возможны только на основании экспертных суждений.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. An analysis of the problem of evaluating alternatives based on the results of expert paired comparisons is presented. The importance and relevance of this task is due to its numerous applications in a variety of fields, whether in the technical and natural sciences or in the humanities, ranging from construction to politics. In such contexts, the problem frequently arises concerning how to calculate an objective ratings vector based on expert evaluations. In terms of a mathematical formulation, the problem of finding the vector of objective ratings can be reduced to approximating the matrices of paired comparisons by consistent matrices.</p></sec><sec><title>Methods</title><p>Methods. Analytical analysis and higher algebra methods are used. For some special cases, the results of numerical calculations are given.</p></sec><sec><title>Results</title><p>Results. The theorem stating that there is always a unique and consistent matrix that optimally approximates a given inversely symmetric matrix in a log-Euclidean metric is proven. In addition, derived formulas for calculating such a consistent matrix are presented. For small dimensions, examples are considered that allow the results obtained according to the derived formula to be compared with results for other known methods of finding a consistent matrix, i.e., for calculating the eigenvector and minimizing the discrepancy in the log-Chebyshev metric. It is proven that all these methods lead to the same result in dimension 3, while in dimension 4 all results are already different.</p></sec><sec><title>Conclusions</title><p>Conclusions. The results obtained in the paper allow us to calculate the vector of objective ratings based on expert evaluation data. This method can be used in strategic planning in cases where conclusions and recommendations are possible only on the basis of expert evaluations.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>экспертные оценки</kwd><kwd>парные сравнения</kwd><kwd>обратно-симметрическая матрица</kwd><kwd>согласованная матрица</kwd><kwd>метрика</kwd><kwd>минимизация невязки</kwd></kwd-group><kwd-group xml:lang="en"><kwd>expert estimates</kwd><kwd>paired comparisons</kwd><kwd>inversely symmetric matrix</kwd><kwd>consistent matrix</kwd><kwd>metric</kwd><kwd>discrepancy minimization</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Коробов В.Б. Теория и практика экспертных методов. М.: ИНФРА-М; 2019. 279 с. ISBN 978-5-16015053-6. https://doi.org/10.12737/monography_5caee0067f1835.43206494</mixed-citation><mixed-citation xml:lang="en">Korobov V.B. Teoriya i praktika ekspertnykh metodov (Theory and Practice of Expert Methods). Moscow: INFRA-M; 2019. 279 p. (in Russ.). ISBN 978-5-16015053-6. https://doi.org/10.12737/monography_5caee0067f1835.43206494</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Андрейчиков А.В., Андрейчикова О.Н. Анализ, синтез, планирование решений в экономике. М.: Финансы и статистика; 2004. 467 с. ISBN 5-279-02901-7</mixed-citation><mixed-citation xml:lang="en">Andreichikov A.V., Andreichikova O.N. Analiz, sintez, planirovanie reshenii v ekonomike (Analysis, Synthesis, Planning of Decisions in the Economy). Moscow: Finansy i statistika; 2004. 467 p. (in Russ.). ISBN 5-279-02901-7</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Саати Т. Принятие решений. Метод анализа иерархий. М.: Радио и связь; 1993. 314 с. ISBN 5-256-00443-3</mixed-citation><mixed-citation xml:lang="en">Saaty T. Prinyatie reshenii. Metod analiza ierarkhii (Decision Making. Hierarchy Analysis Method). Moscow: Radio i svyaz’; 1993. 341 р. (in Russ.). ISBN 5-25600443-3</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Саати Т. Принятие решений при зависимостях и обратных связях: аналитические сети. М.: URSS; 2010. 357 с. ISBN 978-5-397-01622-3</mixed-citation><mixed-citation xml:lang="en">Saaty T. Prinyatie reshenii pri zavisimostyakh i obratnykh svyazyakh: analiticheskie seti (Decision Making with Dependencies and Feedbacks: Analytical Networks). Moscow: URSS; 2010. 357 p. (in Russ.). ISBN 978-5397-01622-3</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Breiman L. Random forests. Machine Learning. 2001;45(1): 5–32. https://doi.org/10.1023/A:1010933404324</mixed-citation><mixed-citation xml:lang="en">Breiman L. Random forests. Machine Learning. 2001;45(1): 5–32. https://doi.org/10.1023/A:1010933404324</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Belov V., Tatarintsev A., Nikulchev E. Comparative characteristics of big data storage formats. J. Phys.: Conf. Ser. 2021;1727(1):012005. http://doi.org/10.1088/1742-6596/1727/1/012005</mixed-citation><mixed-citation xml:lang="en">Belov V., Tatarintsev A., Nikulchev E. Comparative characteristics of big data storage formats. J. Phys.: Conf. Ser. 2021;1727(1):012005. http://doi.org/10.1088/1742-6596/1727/1/012005</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Belov V., Tatarintsev A., Nikulchev E. Choosing a data storage format in the Apache Hadoop system based on experimental evaluation using Apache Spark. Symmetry. 2021;13(2):195. https://doi.org/10.3390/sym13020195</mixed-citation><mixed-citation xml:lang="en">Belov V., Tatarintsev A., Nikulchev E. Choosing a data storage format in the Apache Hadoop system based on experimental evaluation using Apache Spark. Symmetry. 2021;13(2):195. https://doi.org/10.3390/sym13020195</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Moro Visconti R., Morea D. Big data for the sustainability of healthcare project financing. Sustainability. 2019;11(13):3748. https://doi.org/10.3390/su11133748</mixed-citation><mixed-citation xml:lang="en">Moro Visconti R., Morea D. Big data for the sustainability of healthcare project financing. Sustainability. 2019;11(13):3748. https://doi.org/10.3390/su11133748</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Gusev A., Ilin D., Nikulchev E. The dataset of the experimental evaluation of software components for application design selection directed by the artificial bee colony algorithm. Data. 2020;5(3):59. https://doi.org/10.3390/data5030059</mixed-citation><mixed-citation xml:lang="en">Gusev A., Ilin D., Nikulchev E. The dataset of the experimental evaluation of software components for application design selection directed by the artificial bee colony algorithm. Data. 2020;5(3):59. https://doi.org/10.3390/data5030059</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Munir R.F., Abelló A., Romero O., Thiele M., Lehner W. A cost-based storage format selector for materialized resultsinbigdataframeworks. Distrib. Parallel Databases. 2020;38(3):335–364. https://doi.org/10.1007/s10619-019-07271-0</mixed-citation><mixed-citation xml:lang="en">Munir R.F., Abelló A., Romero O., Thiele M., Lehner W. A cost-based storage format selector for materialized results in bigdata frameworks. Distrib. Parallel Databases. 2020;38(3):335–364. https://doi.org/10.1007/s10619-019-07271-0</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Gusev A., Ilin D., Kolyasnikov P., Nikulchev E. Effective selection of software components based on experimental evaluations of quality of operation. Eng. Lett. 2020;28(2):420–427.</mixed-citation><mixed-citation xml:lang="en">Gusev A., Ilin D., Kolyasnikov P., Nikulchev E. Effective selection of software components based on experimental evaluations of quality of operation. Eng. Lett. 2020;28(2):420–427.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Кривулин Н.К., Агеев В.А., Гладких И.В. Применение методов тропической оптимизации для оценки альтернатив на основе парных сравнений. Вестник СПбГУ. Прикладная математика. Информатика. Процессы управления. 2017;13(1):27–41. https://doi.org/10.21638/11701/spbu10.2017.103</mixed-citation><mixed-citation xml:lang="en">Krivulin N.K., Ageev V.A., Gladkikh I.V. Application of methods of tropical optimization for evaluating alternatives based on pairwise comparisons. Vestnik Sankt Peterburgskogo universiteta. Prikladnaya matematika. Informatika. Protsessy upravleniya = Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes. 2017;13(1):27–41. https://doi.org/10.21638/11701/spbu10.2017.103</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Литвинов Г.Л. Деквантование Маслова, идемпотентная и тропическая математика: краткое введение. Записки научных семинаров Санкт-Петербургского отделения математического института им. В.А. Стеклова РАН (Записки научных семинаров ПОМИ). 2005;326(13):145–182.</mixed-citation><mixed-citation xml:lang="en">Litvinov G.L. The Maslov dequantization, idempotent and tropical mathematics: a briff introduction. Zapiski nauchnykh seminarov Sankt-Peterburgskogo otdeleniya matematicheskogo instituta im. V.A. Steklova RAN (Zapiski Nauchnykh Seminarov POMI). 2005;326(13):145–182 (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Гантмахер Ф Р. Теория матриц. М.: Физматлит; 2004. 560 с. ISBN 5-9221-0524-8</mixed-citation><mixed-citation xml:lang="en">Gantmakher F R. Teoriya matrits (Matrix Theory). Moscow: Fizmatlit; 2004. 560 p. (in Russ.). ISBN 5-92210524-8</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Евсеева О.А., Пулькин И.С., Татаринцев А.В. О задаче обработки экспертных суждений. Инновационные технологии в электронике и приборостроении: сборник трудов конференции. М.: РТУ МИРЭА; 2021. Т. 1. С. 355–359.</mixed-citation><mixed-citation xml:lang="en">Evseeva O.A., Pulkin I.S., Tatarintsev A.V. On the problem of processing expert judgments. In: Innovatsionnye tekhnologii v elektronike i priborostroenii: sbornik trudov konferentsii (Innovative technologies in electronics and instrumentation: collection of conference proceedings). Moscow: MIREA; 2021. V. 1. P. 355–359 (in Russ.).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
