Approximating the Convex Edgeworth-Pareto Hull in Integer Multi-objective Problems with Monotone Criteria (in English)

Скачать account_balance Ссылка language

Авторы:

Pospelov A.I.

Издание:

Computational Mathematics and Mathematical Physics, 2009, Volume 49, Issue 10, pp 1686-1699

Абстракт:

A method for the iterative polyhedral approximation of the convex Edgeworth-Pareto hull is proposed and examined experimentally. This method is designed for integer multi-objective problems with monotone objective functions and constraints given by a computational module. It is based on a synthesis of the ideas of the branch-and-bound method and the methods for the polyhedral approximation of convex bodies. A sequence of interior and exterior polyhedral sets is constructed so as to approximate the Edgeworth-Pareto hull to the desired accuracy. The results of the theoretical and experimental analyses of the proposed method are presented.

Ключевые слова: Multi-objective optimization, Discrete optimization, Approximation, Iterative methods, Branch-and-bound method

LinkedIn
VK

Контактная информация

location_on  117246, Москва, Научный проезд, д. 17, 15 этаж

phone  +7 (495) 669-68-15

mail_outline  info@datadvance.net

Связаться navigate_next