Set Relations and Approximate Solutions in Set Optimization
From MaRDI portal
Publication:6310902
DOI10.1287/MOOR.2020.1060arXiv1812.03300MaRDI QIDQ6310902FDOQ6310902
Authors: Giovanni P. Crespi, Andreas H. Hamel, Matteo Rocca, Carola Schrage
Publication date: 8 December 2018
Abstract: Via a family of monotone scalar functions, a preorder on a set is extended to its power set and then used to construct a hull operator and a corresponing complete lattice of sets. A function mappping into the preordered set is extended to a complete lattice-valued one, and concepts for exact and approximate solutions for corresponding set optimization problems are introduced and existence results are given. Well-posedness for complete lattice-valued problems is introduced and characterized. The new approach is compared to existing ones in vector and set optimization, and its relevance is shown by means of many examples from vector optimization, statistics and mathematical economics & finance.
Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
This page was built for publication: Set Relations and Approximate Solutions in Set Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6310902)