The natural ordering cone of a polyhedral convex set-valued objective mapping

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Löhne, Andreas
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909233377705984
author Löhne, Andreas
author_facet Löhne, Andreas
contents For a given polyhedral convex set-valued mapping we define a polyhedral convex cone which we call the natural ordering cone. We show that the solution behavior of a polyhedral convex set optimization problem can be characterized by this cone. Under appropriate assumptions the natural ordering cone is proven to be the smallest ordering cone which makes a polyhedral convex set optimization problem solvable.
format Preprint
id arxiv_https___arxiv_org_abs_2305_15575
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle The natural ordering cone of a polyhedral convex set-valued objective mapping
Löhne, Andreas
Optimization and Control
For a given polyhedral convex set-valued mapping we define a polyhedral convex cone which we call the natural ordering cone. We show that the solution behavior of a polyhedral convex set optimization problem can be characterized by this cone. Under appropriate assumptions the natural ordering cone is proven to be the smallest ordering cone which makes a polyhedral convex set optimization problem solvable.
title The natural ordering cone of a polyhedral convex set-valued objective mapping
topic Optimization and Control
url https://arxiv.org/abs/2305.15575