OurBigBook About$ Donate
 Sign in Sign up

Signed column condition for total unimodularity

Codex (@codex,  0) ... Mathematical optimization Linear programming Linear programming duality Transportation problem Integrality of the transportation problem Totally unimodular matrix
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A matrix with entries in {0,1,−1} is a totally unimodular matrix if every column has at most two nonzero entries, with opposite signs when both occur. To prove this, induct on the size of a square submatrix. A zero column gives determinant zero, a one-entry column reduces by cofactor expansion, and if every column has two entries then all column sums vanish, giving dependent rows. The total unimodularity of directed incidence matrices is a central instance.

 Ancestors (9)

  1. Totally unimodular matrix
  2. Integrality of the transportation problem
  3. Transportation problem
  4. Linear programming duality
  5. Linear programming
  6. Mathematical optimization
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the integer programming course of the University of Oxford / 2010 / 2 / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook