Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 975-1003 |
| Seitenumfang | 29 |
| Fachzeitschrift | OPTIMIZATION |
| Jahrgang | 67 |
| Ausgabenummer | 7 |
| Publikationsstatus | Veröffentlicht - 20 Mai 2018 |
| Extern publiziert | Ja |
Abstract
The well-known Jahn-Graef-Younes algorithm, proposed by Jahn in 2006, generates all minimal elements of a finite set with respect to an ordering cone. It consists of two Graef-Younes procedures, namely the forward iteration, which eliminates a part of the non-minimal elements, followed by the backward iteration, which is applied to the reduced set generated by the previous iteration. Without using the backward iteration, we develop new algorithms that also compute all minimal elements of the initial set, by combining the forward iteration with certain sorting procedures based on cone-monotone functions. In particular, when the ordering cone is polyhedral, computational results obtained in MATLAB allow us to compare our algorithms with the Jahn-Graef-Younes algorithm, within a bi-objective optimization problem.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Steuerung und Optimierung
- Entscheidungswissenschaften (insg.)
- Managementlehre und Operations Resarch
- Mathematik (insg.)
- Angewandte Mathematik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: OPTIMIZATION, Jahrgang 67, Nr. 7, 20.05.2018, S. 975-1003.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
AU - Günther, Christian
AU - Popovici, Nicolae
N1 - Funding information: Nicolae Popovici’s research was supported by a grant of the Romanian Ministry of Research and Innovation, CNCS-UEFISCDI [project number PN-III-P4-ID-PCE-2016-0190], within PNCDI III.
PY - 2018/5/20
Y1 - 2018/5/20
N2 - The well-known Jahn-Graef-Younes algorithm, proposed by Jahn in 2006, generates all minimal elements of a finite set with respect to an ordering cone. It consists of two Graef-Younes procedures, namely the forward iteration, which eliminates a part of the non-minimal elements, followed by the backward iteration, which is applied to the reduced set generated by the previous iteration. Without using the backward iteration, we develop new algorithms that also compute all minimal elements of the initial set, by combining the forward iteration with certain sorting procedures based on cone-monotone functions. In particular, when the ordering cone is polyhedral, computational results obtained in MATLAB allow us to compare our algorithms with the Jahn-Graef-Younes algorithm, within a bi-objective optimization problem.
AB - The well-known Jahn-Graef-Younes algorithm, proposed by Jahn in 2006, generates all minimal elements of a finite set with respect to an ordering cone. It consists of two Graef-Younes procedures, namely the forward iteration, which eliminates a part of the non-minimal elements, followed by the backward iteration, which is applied to the reduced set generated by the previous iteration. Without using the backward iteration, we develop new algorithms that also compute all minimal elements of the initial set, by combining the forward iteration with certain sorting procedures based on cone-monotone functions. In particular, when the ordering cone is polyhedral, computational results obtained in MATLAB allow us to compare our algorithms with the Jahn-Graef-Younes algorithm, within a bi-objective optimization problem.
KW - Graef-Younes reduction method
KW - Partially ordered space
KW - cone-monotone function
KW - domination property
KW - minimal element
KW - multiobjective subdivision technique
UR - http://www.scopus.com/inward/record.url?scp=85047147179&partnerID=8YFLogxK
U2 - 10.1080/02331934.2018.1474469
DO - 10.1080/02331934.2018.1474469
M3 - Article
VL - 67
SP - 975
EP - 1003
JO - OPTIMIZATION
JF - OPTIMIZATION
SN - 0323-3898
IS - 7
ER -