运输问题与Lingo求解此问题为最优化问题，而最优化问题建模中需要确定其数学模型的三要素：决策变量、评价（目标）函数、约束条件。评价（目标）函数:约束条件:运输问题与Lingo求解运输问题与Lingo求解Min=12*x11+13*x12+10x13+11x14+10x21+12x22+14x23+10x24+14x31+11x32+15x33+12x34;x11+x12+x13+x14<=7;x21+x22+x23+x24<=9;x31+x32+x33+x34<=7;x11+x21+x31>=3;x12+x22+x32>=5;x13+x23+x33>=7;x14+x24+x34>=8;END运输问题与Lingo求解运输问题与Lingo求解LINGO有两种类型的集：原始集(primitiveset)和派生集(derivedset)。运输问题与Lingo求解运输问题与Lingo求解sets:Supplier/@ole(‘D:\运输问题.xls','Supplier')/:Supply;Demander/@ole(‘D:\运输问题.xls','Demander')/:Demand;Matrix(Supplier,Demander):PriceMatrix,TransportationMatrix;endsetsdata:PriceMatrix=@ole(‘D:\运输问题.xls');Supply=@ole(‘D:\运输问题.xls');Demand=@ole(‘D:\运输问题.xls');@OLE('D:\运输问题.xls','TransportationMatrix')=TransportationMatrix;enddatamin=@sum(Matrix:PriceMatrix*TransportationMatrix);@for(Supplier(i):@sum(Demander(j):TransportationMatrix(i,j))=Supply(i));@for(Demander(j):@sum(Supplier(i):TransportationMatrix(i,j))=Demand(j));