Warning: Cannot modify header information - headers already sent by (output started at /home/content/69/8662769/html/~~~JANO/index.php:2) in /home/content/69/8662769/html/~~~JANO/wp-content/themes/wport/functions.php on line 218
Christian Günther, Elisabeth Köbis, Nicolae Popovici, Computing minimal elements of finite families of sets w.r.t. preorder relations in set optimization – Journal of Applied and Numerical Optimization Skip to content

Christian Günther, Elisabeth Köbis, Nicolae Popovici, Computing minimal elements of finite families of sets w.r.t. preorder relations in set optimization

Full Text: PDF
DOI: 10.23952/jano.1.2019.2.04
Volume 1, Issue 2, 31 August 2019, Pages 131-144

 

Abstract. We propose new algorithms for computing all 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. These algorithms are based on a set-valued counterpart of the well-known Graef-Younes reduction procedure, originally conceived for vector optimization. One of our algorithms consists of two subsequent (forward-backward) reduction procedures, similarly to the classical Jahn-Graef-Younes method. Another algorithm involves a pre-sorting procedure with respect to a strongly increasing real-valued function, followed by a single (forward) reduction procedure. Numerical experiments in MATLAB allow us to compare our algorithms for special test families of line segments with respect to \ell-type, u-type and s-type preorder relations, currently used in set optimization.

 

How to Cite this Article:
Christian Günther, Elisabeth Köbis, Nicolae Popovici, Computing minimal elements of finite families of sets w.r.t. preorder relations in set optimization, J. Appl. Numer. Optim. 1 (2019), 131-144.