OurBigBook About$ Donate
 Sign in Sign up

Totally unimodular matrix

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Linear programming Linear programming duality Transportation problem Integrality of the transportation problem
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
A matrix is totally unimodular when every square subdeterminant is 0, 1, or −1; linear programs with such a constraint matrix and integer right side have integral vertices.

 Ancestors (8)

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

 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