Total Unimodularity
A totally unimodular matrix (TU matrix) is a matrix for which every square non-singular submatrix is unimodular. A totally unimodular matrix need not be square itself. From the definition it follows that any totally unimodular matrix has only 0, +1 or −1 entries.
Totally unimodular matrices are extremely important in polyhedral combinatorics and combinatorial optimization since they give a quick way to verify that a linear program is integral (has an integral optimum, when any optimum exists). Specifically, if A is TU and b is integral, then linear programs of forms like or have integral optima, for any c. Hence if A is totally unimodular and b is integral, every extreme point of the feasible region (e.g. ) is integral and thus the feasible region is an integral polyhedron.
Read more about this topic: Unimodular Matrix
Famous quotes containing the word total:
“You need an infinite stretch of time ahead of you to start to think, infinite energy to make the smallest decision. The world is getting denser. The immense number of useless projects is bewildering. Too many things have to be put in to balance up an uncertain scale. You can’t disappear anymore. You die in a state of total indecision.”
—Jean Baudrillard (b. 1929)