Full Text: PDF
Volume 1, Issue 3, 31 December 2019, Pages 205-219
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 -type preorder relations induced by the standard ordering cone in the Euclidean plane.
How to Cite this Article:
Christian Günther, Elisabeth Köbis, Nicolae Popovici, On strictly minimal elements w.r.t. preorder relations in set-valued optimization, Appl. Set-Valued Anal. Optim. 1 (2019), 205-219.