数学模型（第五版）4.2 例2

货机装运问题

上代码：

model:
sets:
good/1..4/:w,v,p;
warehouse/1..3/:wet,vol;        !wet质量限制，vol体积限制;
link(good,warehouse):x;
endsets
!定义数据段;
data:
w=18 15 23 12;
v=480 650 580 390;
p=3100 3800 3500 2850;
wet=10 16 8;
vol=6800 8700 5300;
enddata

max=@sum(good(i):@sum(warehouse(j):x(i,j))*p(i));!总利润最大化;
@for(good(i):@sum(warehouse(j):x(i,j))<=w(i));!总质量约束;
@for(warehouse(j):@sum(good(i):x(i,j))<=wet(j));!三个货舱的质量限制;
@for(warehouse(j):@sum(good(i):x(i,j)*v(i))<=vol(j));!三个货舱的空间限制;
@for(warehouse(j):@for(warehouse(k)|k #gt# j:@sum(good(i):x(i,j))/wet(j)=@sum(good(i):x(i,k))/wet(k)));!gt为>=;
end

运行出来和书上结果一致。