Note on prime representations of convex polyhedral sets (Q1102183): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Redundancy in mathematical programming. A state-of-the-art survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal representation of convex polyhedral sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex Analysis / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00940849 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117398013 / rank | |||
Normal rank | |||
Latest revision as of 10:51, 30 July 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
