On the separation of parametric convex polyhedral sets with application in MOLP

Abstract

We investigate diverse separation properties of two convex polyhedral sets for the case when there are parameters in one row of the constraint matrix. In particular, we deal with the existence, description and stability properties of the separating hyperplanes of such convex polyhedral sets. We present several examples carried out on PC. We are also interested in supporting separation (separating hyperplanes support both the convex polyhedral sets at given faces) and permanent separation (a hyperplane separates the convex polyhedral sets for all feasible parameters). Finally, we show how the developed theory is applicable in multiobjective linear programming.