On strictly minimal elements w.r.t. preorder relations in set-valued optimization

Research output: Contribution to journal › Article › Research › peer review

Authors

  • Christian Günther
  • Elisabeth Köbis
  • Nicolae Popovici

External Research Organisations

  • Martin Luther University Halle-Wittenberg
  • Babeş-Bolyai University (UBB)
View graph of relations

Details

Original languageEnglish
Pages (from-to)205-219
Number of pages15
JournalApplied Set-Valued Analysis and Optimization
Volume1
Issue number3
Early online date31 Dec 2019
Publication statusPublished - 2019
Externally publishedYes

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.

Keywords

    External stability, Graef-Younes reduction method, Preorder relation, Set optimization, Sorting scalar function, Strictly minimal element, Vector optimization

ASJC Scopus subject areas

Cite this

On strictly minimal elements w.r.t. preorder relations in set-valued optimization. / Günther, Christian; Köbis, Elisabeth; Popovici, Nicolae.
In: Applied Set-Valued Analysis and Optimization, Vol. 1, No. 3, 2019, p. 205-219.

Research output: Contribution to journal › Article › Research › peer review

Günther, C, Köbis, E & Popovici, N 2019, 'On strictly minimal elements w.r.t. preorder relations in set-valued optimization', Applied Set-Valued Analysis and Optimization, vol. 1, no. 3, pp. 205-219. https://doi.org/10.23952/asvao.1.2019.3.02
Günther, C., Köbis, E., & Popovici, N. (2019). On strictly minimal elements w.r.t. preorder relations in set-valued optimization. Applied Set-Valued Analysis and Optimization, 1(3), 205-219. https://doi.org/10.23952/asvao.1.2019.3.02
Günther C, Köbis E, Popovici N. On strictly minimal elements w.r.t. preorder relations in set-valued optimization. Applied Set-Valued Analysis and Optimization. 2019;1(3):205-219. Epub 2019 Dec 31. doi: 10.23952/asvao.1.2019.3.02
Günther, Christian ; Köbis, Elisabeth ; Popovici, Nicolae. / On strictly minimal elements w.r.t. preorder relations in set-valued optimization. In: Applied Set-Valued Analysis and Optimization. 2019 ; Vol. 1, No. 3. pp. 205-219.
Download
@article{bb94eb49f8044a65a1c94afb56b125b6,
title = "On strictly minimal elements w.r.t. preorder relations in set-valued optimization",
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.",
keywords = "External stability, Graef-Younes reduction method, Preorder relation, Set optimization, Sorting scalar function, Strictly minimal element, Vector optimization",
author = "Christian G{\"u}nther and Elisabeth K{\"o}bis and Nicolae Popovici",
note = "Publisher Copyright: {\textcopyright} 2019 Applied Set-Valued Analysis and Optimization.",
year = "2019",
doi = "10.23952/asvao.1.2019.3.02",
language = "English",
volume = "1",
pages = "205--219",
number = "3",

}

Download

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 -