关于lingo的运输问题
model:
6发点8收点运输问题;
sets:
warehouses/wh1..wh6/:capacity;
vendors/v1..v8/:demand;
links(warehouses,vendors):cost,volume;
endsets
目标函数;
min=@sum(links:cost*volume)
需求约束;
@for(vendors(J):
@sum(warehouses(I):volume(I,J))=demand(J));
产量约束;
@for(warehouses(I):
@sum(vendors(J):volume(I,J))