Digitale Medien
Springer
Journal of optimization theory and applications
61 (1989), S. 137-142
ISSN:
1573-2878
Schlagwort(e):
Convex polyhedral sets
;
linear inequalities
;
minimal representation
;
prime representation
;
redundancy
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF00940849
Permalink
Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |