A solution method for arbitrary polyhedral convex set optimization problems
Optimization and Control
2024-09-27 v4
Abstract
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.
Cite
@article{arxiv.2310.06602,
title = {A solution method for arbitrary polyhedral convex set optimization problems},
author = {Andreas Löhne},
journal= {arXiv preprint arXiv:2310.06602},
year = {2024}
}
Comments
reference [11] added, minor changes (typos)