Note on prime representations of convex polyhedral sets
type: Item
instance of: scholarly article
title: Note on prime representations of convex polyhedral sets
zbMATH Open document ID: 0643.90049
DOI: 10.1007/BF00940849
author: F. W. Lemire
author: Arnon Boneh
author: Richard J. Caron
author: J. Fred McDonald
author: Jan Telgen
author: Ton Vorst
published in: Journal of Optimization Theory and Applications
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 4049380
zbMATH Keywords: convex polyhedral set
zbMATH Keywords: system of linear inequalities
zbMATH Keywords: prime representation
zbMATH Keywords: minimal representation
zbMATH Keywords: redundancy
MaRDI profile type: Publication
cites work: Redundancy in mathematical programming. A state-of-the-art survey
cites work: A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
cites work: Minimal representation of convex polyhedral sets
cites work: Convex Analysis
full work available at URL: https://doi.org/10.1007/bf00940849
OpenAlex ID: W2117398013
description: scientific article; zbMATH DE number 4049380