The polyhedral projection problem (Q2304906)

This paper, which is based on the PhD. thesis of the author, revisits first the so-called polyhedral projection problem. This problem has many applications in different research fields, and it is known that such problems are equivalent to vector linear programs. The core of this paper is the development of a novel solution concept providing new insights into the structure of the projected polyhedron by considering also its lineality space (Section 2). In Section 3, the relationships between the new concept and a previous one from [\textit{A. Löhne} and \textit{B. Weißing}, Math. Methods Oper. Res. 84, No. 2, 411--426 (2016; Zbl 1370.90250)] are discussed. In Section 4, the equivalence between vector linear programs and polyhedral projection problems is shown based on the new solution concept. In particular, the author extends the formulation of vector linear programs by permitting ordering cones that are not necessarily pointed.