Günther, ChristianPopovici, Nicolae2025-05-292017https://epflicht.bibliothek.uni-halle.de/handle/123456789/4872894994077urn:nbn:de:gbv:3:2-753282580599FbTIBIn 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.1 Online-Ressource (37 Seiten, 1,26 MB) : Diagrammeenghttp://rightsstatements.org/vocab/InC/1.0/510Book