Jahn-Graef-Younes type algorithms for discrete vector optimization based on cone-monotone sorting functions / Christian Günther and Nicolae Popovici
Loading...
Download1.26 MB
Jahn-Graef-Younes type algorithms for discrete vector optimization based on cone-monotone sorting functions
Discovery
894994077
URN
urn:nbn:de:gbv:3:2-75328
DOI
ISBN
ISSN
Koordinaten
Skalierung
dc.contributor.contributor
Other contributor
Publication history
Halle/Saale : Martin-Luther-Universität Halle-Wittenberg, Naturwissenschaftliche Fakultät II, Institut für Mathematik, [2017]
Content
1 Online-Ressource (37 Seiten, 1,26 MB) : Diagramme
Edition
Language
eng
Comment
Unterschiede zwischen dem gedruckten Dokument und der elektronischen Ressource können nicht ausgeschlossen werden
Abstract
In this paper we present new Jahn-Graef-Younes type algorithms for solving discrete vector optimization problems. In order to determine all minimal elements of a finite set with respect to an ordering cone, the original approach proposed by Jahn in 2006 (known as the Jahn-Graef-Younes method) consists of a forward iteration (Graef-Younes method), followed by a backward iteration. Our methods involve additional sorting procedures based on scalar cone-monotone functions. In particular, we analyze the case where the ordering cone is polyhedral. Computational results, obtained in MATLAB, allow us to compare our new algorithms with the original Jahn-Graef-Younes method.
Series
Reports ; 2017, No. 06 ppn:584754027