Characterization of set order relations and set optimization problems via conic scalarization

From MaRDI portal





Using Kasimbeyli's conic scalarization function, the paper improves some conditions in set order relations and set optimization problems existing in the literature. Optimality conditions are derived for set-valued optimization problems and robust multiobjective optimization problems under uncertainty. The authors also explain why their approach has some advantages than using the Gerstewitz function. Some illustrated examples are given. The obtained results are interesting; however I wonder if they can be applied when the dimension of spaces is big.



Cites work









This page was built for publication: Characterization of set order relations and set optimization problems via conic scalarization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892806)