Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 205-219 |
| Seitenumfang | 15 |
| Fachzeitschrift | Applied Set-Valued Analysis and Optimization |
| Jahrgang | 1 |
| Ausgabenummer | 3 |
| Frühes Online-Datum | 31 Dez. 2019 |
| Publikationsstatus | Veröffentlicht - 2019 |
| Extern publiziert | Ja |
Abstract
The principal aim of this paper is to develop two algorithms for computing all strictly minimal elements of a nonempty finite family of sets in a real linear space, with respect to a preorder relation defined on the power set of that space. By implementing these algorithms in MATLAB we compute all strictly minimal elements of some test families of rectangles, with respect to `-type and u-type preorder relations induced by the standard ordering cone in the Euclidean plane.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Steuerung und Optimierung
- Mathematik (insg.)
- Analysis
- Mathematik (insg.)
- Angewandte Mathematik
- Mathematik (insg.)
- Numerische Mathematik
- Mathematik (insg.)
- Mathematik (sonstige)
- Mathematik (insg.)
- Modellierung und Simulation
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Applied Set-Valued Analysis and Optimization, Jahrgang 1, Nr. 3, 2019, S. 205-219.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - On strictly minimal elements w.r.t. preorder relations in set-valued optimization
AU - Günther, Christian
AU - Köbis, Elisabeth
AU - Popovici, Nicolae
N1 - Publisher Copyright: © 2019 Applied Set-Valued Analysis and Optimization.
PY - 2019
Y1 - 2019
N2 - The principal aim of this paper is to develop two algorithms for computing all strictly minimal elements of a nonempty finite family of sets in a real linear space, with respect to a preorder relation defined on the power set of that space. By implementing these algorithms in MATLAB we compute all strictly minimal elements of some test families of rectangles, with respect to `-type and u-type preorder relations induced by the standard ordering cone in the Euclidean plane.
AB - The principal aim of this paper is to develop two algorithms for computing all strictly minimal elements of a nonempty finite family of sets in a real linear space, with respect to a preorder relation defined on the power set of that space. By implementing these algorithms in MATLAB we compute all strictly minimal elements of some test families of rectangles, with respect to `-type and u-type preorder relations induced by the standard ordering cone in the Euclidean plane.
KW - External stability
KW - Graef-Younes reduction method
KW - Preorder relation
KW - Set optimization
KW - Sorting scalar function
KW - Strictly minimal element
KW - Vector optimization
UR - http://www.scopus.com/inward/record.url?scp=85105870718&partnerID=8YFLogxK
U2 - 10.23952/asvao.1.2019.3.02
DO - 10.23952/asvao.1.2019.3.02
M3 - Article
VL - 1
SP - 205
EP - 219
JO - Applied Set-Valued Analysis and Optimization
JF - Applied Set-Valued Analysis and Optimization
SN - 2562-7775
IS - 3
ER -