Method of Construction of pareto set At a dynamic initial data reception
Abstract
The many-criterial task of pareto alternatives finding at a dynamic set of initial data is considered. The general scheme of construction of partial solutions in a case when each element is formed on certain computing algorithm is presented. Concepts of dominating and dominated vectors on pareto set are defined and the algorithm of their construction is offered. The scheme of formation of partial solutions without direct comparison of alternatives is developed.
About the Authors
S. V. Chebakov
Объединенный институт проблем информатики НАН Беларуси
Belarus
Belarus
L. V. Serebryanaya
Белорусский государственный университет информатики и радиоэлектроники
Belarus
Belarus
References
1. Дубов Ю.А., Травкин С.И., Якимец В.Н. Многокритериальные модели формирования и выбора вариантов систем. М., 1986.
2. Чебаков С.В. // Вести НАН Беларуси. Сер. физ.-мат. наук. 2009. № 3. С. 105-113.
3. Сэвидж Дж. Э. Сложность вычислений. М., 1998.
4. Kellerer H., Pfershy U., Pisinger D. Knapsack Problems. Springer Verlag, 2004.
5. Чебаков С.В. // Вести НАН Беларуси. Сер. физ.-мат. наук. 2005. № 2. С. 112-119.
Review
For citations:
Chebakov S.V., Serebryanaya L.V. Method of Construction of pareto set At a dynamic initial data reception. Doklady BGUIR. 2013;(3):83-87. (In Russ.)
Views: 308
Email this article 