| Article ID: | iaor19921138 |
| Country: | Netherlands |
| Volume: | 49 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 5 |
| Publication Date: | Nov 1990 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Blair Charles |
Finitely many polyhedra defined by a linear constraints are given, using the same constraint matrix and different right-hand sides. A simple constraint system is considered and given necessary and sufficient conditions for this system to define the union of the polyhedra. It is also shown that deciding whether the system does define the union is NP-hard.