Note on Prime Representation of Convex Polyhedral Sets

A. Boneh; R.J. Caron; F.W. Lemire; J.F. McDonald; J. Telgen; A.C.F. Vorst

doi:10.1007/BF00940849

Note on Prime Representation of Convex Polyhedral Sets

A. Boneh, R.J. Caron, F.W. Lemire, J.F. McDonald, J. Telgen, A.C.F. Vorst

Finance

Research output: Contribution to Journal › Article › Academic › peer-review

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. © 1989 Plenum Publishing Corporation.

Original language	English
Pages (from-to)	137-142
Journal	Journal of Optimization Theory and Applications
Volume	61
Issue number	1
DOIs	https://doi.org/10.1007/BF00940849
Publication status	Published - 1989

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/BF00940849

Persistent URL (handle)

Persistent link

Cite this

@article{d1144f8a1ddb47b6aef249d93921a34d,

title = "Note on Prime Representation of Convex Polyhedral Sets",

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. {\textcopyright} 1989 Plenum Publishing Corporation.",

author = "A. Boneh and R.J. Caron and F.W. Lemire and J.F. McDonald and J. Telgen and A.C.F. Vorst",

year = "1989",

doi = "10.1007/BF00940849",

language = "English",

volume = "61",

pages = "137--142",

journal = "Journal of Optimization Theory and Applications",

issn = "0022-3239",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Note on Prime Representation of Convex Polyhedral Sets

AU - Boneh, A.

AU - Caron, R.J.

AU - Lemire, F.W.

AU - McDonald, J.F.

AU - Telgen, J.

AU - Vorst, A.C.F.

PY - 1989

Y1 - 1989

N2 - 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. © 1989 Plenum Publishing Corporation.

AB - 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. © 1989 Plenum Publishing Corporation.

U2 - 10.1007/BF00940849

DO - 10.1007/BF00940849

M3 - Article

SN - 0022-3239

VL - 61

SP - 137

EP - 142

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

IS - 1

ER -

Note on Prime Representation of Convex Polyhedral Sets

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this