Some properties of K-convex mappings in variable ordering settings
Journal article, Peer reviewed
Published version
![Thumbnail](/bora-xmlui/bitstream/handle/11250/3048032/Some%20properties%20of%20K%20convex%20mappings%20in%20variable%20ordering%20settings.pdf.jpg?sequence=7&isAllowed=y)
View/ Open
Date
2022Metadata
Show full item recordCollections
- Department of Informatics [928]
- Registrations from Cristin [9791]
Original version
Optimization. 2022, 71 (14), 4125-4146. https://doi.org/10.1080/02331934.2021.1937159Abstract
We consider a generalization of standard vector optimization which is called vector optimization with variable ordering structures. The problem class under consideration is characterized by a point-dependent proper cone-valued mapping: here, the concept of K-convexity of the incorporated mapping plays an important role. We present and discuss several properties of this class such as the cone of separations and the minimal variable K-convexification. The latter one refers to a general approach for generating a variable ordering mapping for which a given mapping is K-convex. Finally, this approach is applied to a particular case.