Global maximization of UTA functions in multi-objective optimization

► We propose an algorithm for globally maximizing UTA function for convex multi-objective optimization problems. ► This is a finite branch and bound algorithm.The most expensive tasks are performed in the space of the objectives. ► The algorithm works well for problems, in which the number of object...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 228; no. 2; pp. 397 - 404
Main Author:	Nguyen, Duy Van
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.07.2013 Elsevier Elsevier Sequoia S.A
Subjects:	Algorithms Branch & bound algorithms Branch-and-bound algorithm Decision analysis Global optimization Mathematical programming Multiple criteria decision making Multiple objective optimization Optimization algorithms Studies UTA functions UTA type methods Utility function program Utility functions Utility function program Global optimization UTA type methods UTA functions Multiple objective optimization Branch-and-bound algorithm
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!