Вісник № 01. Системний аналіз, управління та інформаційні технології

Постійне посилання колекціїhttps://repository.kpi.kharkov.ua/handle/KhPI-Press/42344

Переглянути

Фільтри

20191

Налаштування

Автор: search.filters.author.Pavlov, Alexander AnatolievichКлючові слова: search.filters.subject.compromise criteria

Результати пошуку

Зараз показуємо 1 - 1 з 1
  • Ескіз
    Документ
    Combinatorial optimization under uncertainty and formal models of expert estimation
    (НТУ "ХПІ", 2019) Pavlov, Alexander Anatolievich
    Previously, the author formalized the concepts of uncertainty, compromise solution, compromise criteria and conditions for a quite general class of combinatorial optimization problems. The functional of the class’ problems contains linear convolution of weights and arbitrary numerical characteristics of a feasible solution. It was shown that the efficiency of the presented algorithms for the uncertainty resolution is largely determined by the efficiency of solving the combinatorial optimization problem in a deterministic formulation. A part of the formulated compromise criteri a and conditions uses expert weights. Previously, the author and his disciples also formulated combinatorial optimization models, optimality criteria, criteria for decisions’ consistency. The models allow to evaluate and justify the degree of stability and reliability of the estimated values of empirical coefficients using a formally ill-conditioned empirical pairwise comparison matrix of arbitrary dimension. The matrix may contain zero elements. The theoretical research and statistical experiments allowed to choose the most efficient of these optimization models. In this article, on the base of earlier results by the author and his disciples, we formalize and substantiate the efficiency of the proposed sequential procedure for expert estimation of weights that determine compromise criteria and conditions. The procedure is an integral part of the algorithm introduced by the author to solve combinatorial optimization problems under uncertainty of the mentioned class. We give unified algorithm for efficient uncertainty resolution that includes original and efficient formal procedure for expert coefficients’ estimation using empirical matrices of pairwise comparisons.