Integrality of the transportation problem

Integer supplies and demands admit an integer optimum because an integer initial basis and every cycle pivot remain integer.

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.