Note on prime representations of convex polyhedral sets (Q1102183): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:37, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on prime representations of convex polyhedral sets |
scientific article |
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
