求每一行的解释,尤其那个for循环.lingo关于最小运输费用的编程问题.求每一行的解释,尤其那个for循环.model:6 发点 8 收点运输问题; sets:warehouses/wh1..wh6/:capacity; vendors/v1..v8/:demand; links(warehouses,ven
来源:学生作业帮助网 编辑:作业帮 时间:2024/08/01 09:54:31
![求每一行的解释,尤其那个for循环.lingo关于最小运输费用的编程问题.求每一行的解释,尤其那个for循环.model:6 发点 8 收点运输问题; sets:warehouses/wh1..wh6/:capacity; vendors/v1..v8/:demand; links(warehouses,ven](/uploads/image/z/11666467-19-7.jpg?t=%E6%B1%82%E6%AF%8F%E4%B8%80%E8%A1%8C%E7%9A%84%E8%A7%A3%E9%87%8A%2C%E5%B0%A4%E5%85%B6%E9%82%A3%E4%B8%AAfor%E5%BE%AA%E7%8E%AF.lingo%E5%85%B3%E4%BA%8E%E6%9C%80%E5%B0%8F%E8%BF%90%E8%BE%93%E8%B4%B9%E7%94%A8%E7%9A%84%E7%BC%96%E7%A8%8B%E9%97%AE%E9%A2%98.%E6%B1%82%E6%AF%8F%E4%B8%80%E8%A1%8C%E7%9A%84%E8%A7%A3%E9%87%8A%2C%E5%B0%A4%E5%85%B6%E9%82%A3%E4%B8%AAfor%E5%BE%AA%E7%8E%AF.model%3A6+%E5%8F%91%E7%82%B9+8+%E6%94%B6%E7%82%B9%E8%BF%90%E8%BE%93%E9%97%AE%E9%A2%98%3B+sets%3Awarehouses%2Fwh1..wh6%2F%3Acapacity%3B+vendors%2Fv1..v8%2F%3Ademand%3B+links%28warehouses%2Cven)
求每一行的解释,尤其那个for循环.lingo关于最小运输费用的编程问题.求每一行的解释,尤其那个for循环.model:6 发点 8 收点运输问题; sets:warehouses/wh1..wh6/:capacity; vendors/v1..v8/:demand; links(warehouses,ven
求每一行的解释,尤其那个for循环.lingo关于最小运输费用的编程问题.
求每一行的解释,尤其那个for循环.
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))
求每一行的解释,尤其那个for循环.lingo关于最小运输费用的编程问题.求每一行的解释,尤其那个for循环.model:6 发点 8 收点运输问题; sets:warehouses/wh1..wh6/:capacity; vendors/v1..v8/:demand; links(warehouses,ven
!需求约束;
@for(vendors(J):
@sum(warehouses(I): volume(I,J))=demand(J));
首先先看里面的嵌套:@sum(warehouses(I): volume(I,J))=demand(J) 意思从1到i的产地分别运往接受地J的产量总和满足J的需求,外面的@for(vendors(J))是从1到J的意思.
!产量约束;
@for(warehouses(I):
@sum(vendors(J): volume(I,J))