Consider the general linear programming formulation of the transportation problem (see Table 9.6). Verify the claim in Sec. 9.2 that the set of (m + n) functional constraint equations (m supply constraints and n demand constraints) has one redundant equation; i.e., any one equation can be reproduced from a linear combination of the other (m + n – 1) equations.