|
|||||
|
|
Note on prime representations of convex polyhedral sets |
|
| Authors: | A. Boneh R. J. Caron F. W. Lemire J. F. McDonald J. Telgen T. Vorst |
| Affiliation: | (1) The Hebrew University, Jerusalem, Israel;(2) Department of Mathematics and Statistics, University of Windsor, Windsor, Ontario, Canada;(3) Department of Applied Mathematics, Twente University of Technology, Enschede, The Netherlands;(4) Erasmus Universiteit, Rotterdam, The Netherlands |
| Abstract: | Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation of the polyhedron is one that contains no redundant constraints. We present a sharp upper bound on the difference between the cardinalities of any two primes.This research was supported by the Natural Sciences and Engineering Research Council of Canada under Grant Nos. A8807, A4625, and A7742. |
| Keywords: | Convex polyhedral sets linear inequalities minimal representation prime representation redundancy |
| 本文献已被 SpringerLink 等数据库收录！ | |