Existence of solutions for polyhedral convex set optimization problems

DOI10.1080/02331934.2023.2280018arXiv2304.09298MaRDI QIDQ6509705FDOQ6509705

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.

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Mathematical programming (90C99)

This page was built for publication: Existence of solutions for polyhedral convex set optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509705)