Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming

Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number of objectives of the multipl...

Celý popis