Note on prime representations of convex polyhedral sets (Q1102183)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1102183 |
scientific article; zbMATH DE number 4049380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on prime representations of convex polyhedral sets |
scientific article; zbMATH DE number 4049380 |
Statements
Note on prime representations of convex polyhedral sets (English)
0 references
1989
0 references
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.
0 references
convex polyhedral set
0 references
system of linear inequalities
0 references
prime representation
0 references
minimal representation
0 references
redundancy
0 references
0.801333487033844
0 references
0.756064772605896
0 references
