scientific article
From MaRDI portal
Publication:3182618
zbMath1171.90471MaRDI QIDQ3182618
Yingbo Li, Anton Kummert, Andreas Frommer
Publication date: 12 October 2009
Full work available at URL: https://eudml.org/doc/207675
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingsimplex algorithmcompletely positive matricescp-rankpivot processbasic feasible solution
Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
A note on the computation of the CP-rank ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ The \(\mathcal A\)-truncated \(K\)-moment problem ⋮ A note on upper bounds on the cp-rank
