Transportation Problem Solve TP by LP 。 Let m (=3)be the number of sources and n(=4)be the number of sinks, a;=the supply from the source i,1s ism bi=the demand of sink j,1sjsn; cthe cost of shipping one unit from source i to sink j; Xthe flow from the source i to sink j for 1s ism and 1sj<n; m n Subject to Min ∑∑， i=1 j=l S4gpW:∑y=a,or1≤i≤m i=l Dend:∑x=b,or1sjsr Nonegtive:x,≥0，for1≤i≤nand1≤j≤nSolve TP by LP • Let m (=3) be the number of sources and n (=4) be the number of sinks; • ai= the supply from the source i, 1 im • bj =the demand of sink j, 1jn; • cij =the cost of shipping one unit from source i to sink j; • xij=the flow from the source i to sink j for 1 im and 1jn; Transportation Problem 1 1 m n ij ij i j Min c x    Subject to 1 1 : ,1 ; : ,1 ; : 0, 1 1 n ij i j m ij j i ij Supply x a for i m Demand x b for j n Nonegtive x for i mand j n            