该运输问题的数学模型为: minz= ∑∑cx=4x1+12x2+4x3+11+2x21 +10x2+3x23+9x24+8x31+5x2+11x3+6x34 x1+x1 12 +x1 16 21 x 23 24 10 + 22 Xu+X x 31 x1,+x2,+x2=14 13 x x Xu+x 14 24 x 14 ≥0,i=1,2,3;j=1,2,342 2 2 3 2 4 3 1 3 2 3 3 3 4 2 1 3 1 4 1 1 1 1 2 1 3 1 4 10 3 9 8 5 11 6 min 4 12 4 11 2 x x x x x x x z c x x x x x x i j i j i j + + + + + + + =  = + + + + = =               = = + + = + + = + + = + + = + + + = + + + = + + + = 0, 1, 2,3; 1,2,3,4 14 12 14 8 22 10 16 1 4 2 4 3 4 1 3 2 3 3 3 1 2 2 2 3 2 1 1 2 1 3 1 3 1 3 2 3 3 3 4 2 1 2 2 2 3 2 4 1 1 1 2 1 3 1 4 x i j x x x x x x x x x x x x x x x x x x x x x x x x i j 该运输问题的数学模型为：