A solution method for arbitrary polyhedral convex set optimization problems
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913518715928576 |
|---|---|
| author | Löhne, Andreas |
| author_facet | Löhne, Andreas |
| contents | We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral convex cone . The method is proven to be correct and finite without any further assumption to the problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_06602 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A solution method for arbitrary polyhedral convex set optimization problems Löhne, Andreas Optimization and Control 90C99, 90C29, 90C05 We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral convex cone . The method is proven to be correct and finite without any further assumption to the problem. |
| title | A solution method for arbitrary polyhedral convex set optimization problems |
| topic | Optimization and Control 90C99, 90C29, 90C05 |
| url | https://arxiv.org/abs/2310.06602 |