Existence of solutions for polyhedral convex set optimization problems

Abstract

Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear programs and multiple objective linear programs provide proper subclasses. In this article, we choose a solution concept for arbitrary polyhedral convex set optimization problems out of several alternatives, show existence of solutions and characterize the existence of solutions in different ways. Two known results are obtained as particular cases, both with proofs being easier than the original ones: The existence of solutions of bounded polyhedral convex set optimization problems and a characterization of the existence of solutions of vector linear programs.