Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2312.14783 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929509304893440 |
|---|---|
| author | Hieu, Vu Trung Köbis, Elisabeth Anna Sophia Köbis, Markus Arthur Schmölling, Paul Hugo |
| author_facet | Hieu, Vu Trung Köbis, Elisabeth Anna Sophia Köbis, Markus Arthur Schmölling, Paul Hugo |
| contents | In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to see structural properties of solutions in vector optimization, where solution sets can be considered as the images of solution mappings associated to specific scalarization methods. In particular, we prove that if the domain of a certain solution mapping is non-closed, then the weak Pareto solution set is unbounded. Furthermore, for a quasi-convex problem, we demonstrate two criteria to ensure that if the weak Pareto solution set is disconnected then each connected component is unbounded. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_14783 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Unboundedness of the images of set-valued mappings having closed graphs: Application to vector optimization Hieu, Vu Trung Köbis, Elisabeth Anna Sophia Köbis, Markus Arthur Schmölling, Paul Hugo Optimization and Control In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to see structural properties of solutions in vector optimization, where solution sets can be considered as the images of solution mappings associated to specific scalarization methods. In particular, we prove that if the domain of a certain solution mapping is non-closed, then the weak Pareto solution set is unbounded. Furthermore, for a quasi-convex problem, we demonstrate two criteria to ensure that if the weak Pareto solution set is disconnected then each connected component is unbounded. |
| title | Unboundedness of the images of set-valued mappings having closed graphs: Application to vector optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2312.14783 |