Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
