Note on prime representations of convex polyhedral sets (Q1102183): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Arnon Boneh / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Richard J. Caron / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: J. Fred McDonald / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jan Telgen / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Ton Vorst / rank | |||
Normal rank | |||
Revision as of 09:18, 10 February 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
