1P66:8
某部门有3个生产同类产品的工厂(产地),生产的产品由4个销售点出售,各工厂A1,A2,A3的生产量、各销售点B1,B2,B3,B4的销售量(假定单位为t)以及各工厂到销售点的单位运价(元/t)示于下表中,问如何调运才能使总运费最小
表销地产地B1B2B3B4产量A141241116A22103910A38511622销量814121448解:一、该运输问题的数学模型为:可以证明:约束矩阵的秩为r(A)=6
从而基变量的个数为6
34333231242322213141141312116115893102114124minxxxxxxxxxxxxxczijijij4,3,2,1;3,2,1,01412148221016342414332313322212312111343332312423222114131211jixxxxxxxxxxxxxxxxxxxxxxxxxij111213142122232431323334xxxxxxxxxxxx7121111111111111111111111112二、给出运输问题的初始可行解(初始调运方案)1
最小元素法思想:优先满足运价(或运距)最小的供销业务
销地产地B1B2B3B4产量A141241116A282103910A38511622销量814121448销地产地B1B2B3B4产量A141241116A282103910A38511622销量814101448销地产地B1B2B3B4产量A141210411166A282103910A38511622销量81410144882①82②①82②①10③3销地产地B1B2B3B4产量A141210411166A282103910A38145116228销量814101448销地产地B1B2B3B4产量A141210411166A282103910A38145118622