An Integer Programming Problem and Rank Decomposition of Block Upper Triangular Matrices
January 2000
Article
pp 107-219.
| Related Files |
|---|
|
Redirect to publisher's version
(publisher's version.url.txt, 51 bytes) |
Repository contains one additional file which is not publicly available
A necessary and sufficient condition is given for a block upper triangular matrix A to be the sum of block upper rectangular matrices satisfying certain rank constraints. The condition is formulated in terms of the ranks of certain submatrices of A. The proof goes by reduction to an integer programming problem. This integer programming problem has a totally unimodular constraint matrix which makes it possible to utilize Farkas' Lemma.
Keywords
- Integer programming
- Additive decomposition
- Block upper triangular matrices
- Farkas' Lemma
- Rank constraints
