Title of article
An upper bound for nonnegative rank
Author/Authors
Shitov، نويسنده , , Yaroslav، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
7
From page
126
To page
132
Abstract
We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices which allows us to prove that ⌈ 6 n / 7 ⌉ linear inequalities suffice to describe a convex n-gon up to a linear projection.
Keywords
Nonnegative factorization , Extended formulation , Convex polytope
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2014
Journal title
Journal of Combinatorial Theory Series A
Record number
1531979
Link To Document