lingo混合整数规划模型求解model:sets:s1/l,2/a;s2/1..3/:f,w,m,c;s3/1..5/

雪域狐狸2022-10-04 11:39:541条回答

lingo混合整数规划模型求解
model:
sets:
s1/l,2/a;
s2/1..3/:f,w,m,c;
s3/1..5/:b;
ssl(s1,s2):U1,x,L1;
ss2(s2,s3):U2,y,L2;
ss3(s1,s3):U3,z,L3;
endsets
data:
a=118000 80000;
b=38200 60100 45400 72100 63000;
f=800000 865000 790000;
m=100 105 110;
c=16000 16000 15000;
L1=3363 3596 3596
4141 4141 4427;
L2=3363 2732 2732 4290 4427;
3798 3085 2732 4290 4141
3596 3363 2732 4290 4556;
L3=3363 3363 3085 4141 x054427
3978 3978 3978 3363 3363;
U1=20.79 28.35 23.94
88.2 80.64 101.43;
U2=17.64 12.6x0515.12x0566.78x0589.46
40.95x0515.12x0512.6x0564.89x0585.05
37.8x0523.94x0511.97x0581.9x05102.06;
U3=27.72 26.46 22.68 80.64 107.1
86.94 74.97 88.2x05 20.16 22.05;
enddata
min=@sum(ss1:(U1+L1)*x(i,k))+@sum(ss2:(U2+L2)*y(k,j))+@sum(ss3:U3+L3)*z(i,j))+@sum(s2:f(k)*w(k))+@sum(ss1(i,k):m(k)*x(i,k)*w(k));
@for(s1(i):@sum(s2(k):x(i,k))+@sum(s3(j):z(i,j))

已提交,审核后显示!提交回复

共1条回复
kaite000901 共回答了14个问题 | 采纳率100%
model:sets:s1/l,2/:a;s2/1..3/:f,w,m,c;s3/1..5/:b;ss1(s1,s2):U1,x,L1;ss2(s2,s3):U2,y,L2;ss3(s1,s3):U3,z,L3;endsetsdata:a=118000 80000;b=38200 60100 45400 72100 63000;f=800000 865000 790000;m=100 105 11...
1年前

相关推荐

请问一个LINGO求解混合整数规划问题?
请问一个LINGO求解混合整数规划问题?
我这建了一个数学模型,从8个供应商选择几个进行订货,X为订货量,Y为0-1变量,选择时为1不选时为0.用LINGO编程,运行时显示错误为:unexpected jacobian overflow.我的程序如下,我是初学者,
model1:
SETS:
m/p1,p2,p3,p4,p5,p6,p7,p8/:y,x,w,v,q,t;
ENDSETS
DATA:
w=0.233,0.544,0.329,0.780,0.533,0.454,0.762,0.303;
v=4000,2500,3500,1800,2500,2600,1800,2500;
q=0.022,0.015,0.024,0.032,0.02,0.018,0.03,0.02;
t=0.04,0.015,0.025,0,0.015,0.02,0.01,0.02;
D=5000;
Q=0.025;
t=0.025;
n=4;
ENDDATA
The objective;
max=@sum(m(j):v(j)*x(j));
The capacity constraints;
@for(m(j):x(j)≤v(j)*y(j));
The demand constraints;
@sum(m(j):x(j))≥D;
The quality constraints;
@sum(m(j):x(j)*q(j))≤Q*D;
The time constraints;
@sum(m(j):x(j)*t(j))≤T*D;
The number of suppliers constraints;
@sum(m(j):y(j))≤4;
@for(m(j):@bin(y(j)));
@for(m(j):@gin(x(j)));
end
cc畅1年前1
ojw19999 共回答了21个问题 | 采纳率95.2%
model: SETS: m/p1,p2,p3,p4,p5,p6,p7,p8/:y,x,w,v,q,t; ENDSETS DATA: w=0.233,0.544,0.329,0.780,0.533,0.454,0.762,0.303; v=4000,2500,3500,1800,2500,2600,1800,2500; q=0.022,0.015,0.024,0.032,0.02,0.018,0.03,0.02; t=0.04,0.015,0.025,0,0.015,0.02,0.01,0.02; D=5000; Q1=0.025; t1=0.025; n=4; ENDDATA !The objective; max=@sum(m(j):v(j)*x(j)); !The capacity constraints; @for(m(j):x(j)=D; !The quality constraints; @sum(m(j):x(j)*q(j))
求高手帮我用lingo软件计算混合整数规划的配送选址问题
求高手帮我用lingo软件计算混合整数规划的配送选址问题
某市想要建立一个大型的物流配送中心,为5个周边的超市提供需求,配送中心的货品由3个供应点提供,现在要求在备选的3个备选点建设一个物流配送中心.假设生鲜产品在运输中的变质率为0.01,单位农产品的价值为8,运费率为3.各超市和备选点的坐标和需求量如表

表3-1各超市的坐标和需求量

A
(20,20)
50
B
(20,60)
40
C
(60,80)
60
D
(80,40)
20
E
(60,20)
30







表3-2备选点的坐标、容量和流量
坐标
容量
流量
(40,20)
150
30
(40,60)
200
50
(60,60)
100
18









基建投资;(,)表示第i个需求点的坐标(i=1,2,…,m)
表示第i个需求点的需求量 ;(,)表示第j个物流中心的坐标
表示第j个物流中心的流量限制 ;表示第j个物流中心的容量限制
表示第i个物流中心到第j个需求点的距离;
表示由第j个运输了L距离时的剩余量;
θ 表示农产品在运输过程中物流中心向第i个需求点配送的农产品单位距离内的变质率; 表示由第j个物流中心向第i个需求点配送农产品所需的运费
ω 表示单位农产品的价值;
‍‍‍‍‍‍
‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍‍







1239881年前1
pkchj 共回答了17个问题 | 采纳率76.5%
sets:
si/1..5/:s,x,y;
sj/1..3/:u,r,m,n;
sij(si,sj):l,h;
endsets
data:
X=20 20 60 80 60;
Y=20 60 80 40 20;
M=40 40 60;
N=20 60 60;
S=50 40 60 20 30;
R=150 200 100;
U=30 50 18;
theta=0.4;
omega=8;
enddata
calc:
@for(sij(i,j):l(i,j)=@sqrt((x(i)-m(j))^2+(y(i)-n(j))^2));
endcalc
min=@sum(sij(i,j):s(i)/(1-theta)^l(i,j)+(l(i,j)+omega*s(i))*h(i,j));
@for(sj(j):@sum(si(i):s(i)*h(i,j))
求Lingo高手帮忙混合整数规划求解!求Lingo编程!
求Lingo高手帮忙混合整数规划求解!求Lingo编程!
五个城市A、B、C、D、E选择其中两个城市设立仓库,分别向A、B、C、D、E五个城市 的客户派送货物,从任意仓库派送货物至客户有时限要求,不能超过三个小时.A城市客户年需求为20件,B城市客户年需求为30件,C城市客户年需求为10件,D城市客户年需求为15件,A城市客户年需求为25件.每件货物派送费用为每件每半小时10元,即一件1小时收20元,2小时收40元.现已知五个城市至客户的派送时间如下所示.
A B C D E
A 1 2 3 3 2
B 2 1 2 3 3
C 3 2 1 2 3
D 3 3 2 1 2
E 1 3 3 2 1
NN幽蓝1年前1
尘封的笔 共回答了9个问题 | 采纳率77.8%
model:
sets:
city/1..5/:x,demand;
link(city,city):c,time;
endsets
data:
price=20;
time=
1 2 3 3 2
2 1 2 3 3
3 2 1 2 3
3 3 2 1 2
1 3 3 2 1;
demand=20 30 10 15 25;
enddata
min=@sum(city(j):demand(j)*@sum(city(i):c(i,j)*time(i,j)));
@sum(city:x)=2;
@for(city(i):@for(city(j):c(i,j)