An upper bound for nonnegative rank

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:122

Article

Shitov, Yaroslav

关键词: Convex polytope;    Extended formulation;    Nonnegative factorization;   

DOI  :  10.1016/j.jcta.2013.10.004

来源: Elsevier

【 摘 要 】

We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices which allows us to prove that inverted right perpendicular6n/7inverted left perepndicular linear inequalities suffice to describe a convex n-gon up to a linear projection. (C) 2013 Elsevier Inc. All rights reserved.

【 授权许可】

Free