lingo 0-1规划问题model:sets:class/1..56/;number/1..56/;assign(class,number):c,x;endsetsdata:c = 41,45,44,44,26,44,42,20,20,38,37,25,45,45,45,44,20,30,39,35,38,38,28,25,30,36,20,24,32,33,41,33,51,39,20,20,44,37,38,39,42,40,37,50,50,42,43,41,42,45,

来源:学生作业帮助网 编辑:作业帮 时间:2024/05/02 16:54:16
lingo 0-1规划问题model:sets:class/1..56/;number/1..56/;assign(class,number):c,x;endsetsdata:c = 41,45,44,44,26,44,42,20,20,38,37,25,45,45,45,44,20,30,39,35,38,38,28,25,30,36,20,24,32,33,41,33,51,39,20,20,44,37,38,39,42,40,37,50,50,42,43,41,42,45,

lingo 0-1规划问题model:sets:class/1..56/;number/1..56/;assign(class,number):c,x;endsetsdata:c = 41,45,44,44,26,44,42,20,20,38,37,25,45,45,45,44,20,30,39,35,38,38,28,25,30,36,20,24,32,33,41,33,51,39,20,20,44,37,38,39,42,40,37,50,50,42,43,41,42,45,
lingo 0-1规划问题
model:
sets:
class/1..56/;
number/1..56/;
assign(class,number):c,x;
endsets
data:
c = 41,45,44,44,26,44,42,20,20,38,37,25,45,45,45,44,20,30,39,35,38,38,28,25,30,36,20,24,32,33,41,33,51,39,20,20,44,37,38,39,42,40,37,50,50,42,43,41,42,45,42,19,39,75,17,17;
Enddata
max=@sum(assign:c*x);
@for(assign(i):@bin(x(i)));
end
求大神看下哪里错了

lingo 0-1规划问题model:sets:class/1..56/;number/1..56/;assign(class,number):c,x;endsetsdata:c = 41,45,44,44,26,44,42,20,20,38,37,25,45,45,45,44,20,30,39,35,38,38,28,25,30,36,20,24,32,33,41,33,51,39,20,20,44,37,38,39,42,40,37,50,50,42,43,41,42,45,
c是56*56的矩阵,你给的那点数据明显不够数...
model:
sets:
class/1..56/;
number/1..56/;
assign(class,number):c,x;
endsets
data:
!c = 41,45,44,44,26,44,42,20,20,38,37,25,45,45,45,44,20,30,39,35,38,38,28,25,30,36,20,24,32,33,41,33,51,39,20,20,44,37,38,39,42,40,37,50,50,42,43,41,42,45,42,19,39,75,17,17;
Enddata
max=@sum(assign:c*x);
@for(assign:@bin(x));
end

lingo求0-1规划问题 lingo 0-1规划程序问题Max=∑xi (i∈E)s.t Hq=0 (H为VxE的已知矩阵)-1000xi 怎样用lingo解决0-1规划问题,请顺便给举个例子吧, 如何用lingo解整数规划问题? 如何用lingo解整数规划问题? lingo 中的 0-1规划能否具体举例说明? 在lingo中如何表示整数,或者0-1规划 lingo中求最小值问题model:max=x1+x2;-1 1、利用Matlab或Lingo软件计算以下规划问题,写出其对应程序 LINGO问题.这个LINGO的为什么运行不了.关键是S(i,1)=0,和s(i,7)=0..model:sets:si/1..6/;sj/1..7/;st/1..5/:l;sij(si,sj):c,x,s;stj(st,sj):a;sit(si,st):k;endsetsmin=@sum(sij(i,j):c(i,j)*x(i,j));@for(sj(j):@for(si(i)|i#le#5:s(i+1,j)=s(i,j)+x(i 整数规划问题,用lingo应该如何编? 非线性规划问题(数学建模 lingo),求指教model:title 1-1;sets:jidu/1..3/:x,r,w;endsetsdata:w=40 60 80;enddatamin=@sum(jidu:50*x+0.2*x*x+4*r);@for(jidu:r+x>w);@for(jidu:x<100);r(1)=0;@for(jidu(i)|i#lt#3:r(i+1)=x(i)-w(i)+r(i));end lingo求解非线性整数规划问题用lingo求解下面的问题 lingo 0-1规划问题model:sets:class/1..56/;number/1..56/;assign(class,number):c,x;endsetsdata:c = 41,45,44,44,26,44,42,20,20,38,37,25,45,45,45,44,20,30,39,35,38,38,28,25,30,36,20,24,32,33,41,33,51,39,20,20,44,37,38,39,42,40,37,50,50,42,43,41,42,45, lingo中的0-1规划model:sets:js/1..45/:N,x,y;!n代表灯管数;ssq/1..10/:m;zxq/1..9/:e;links(zxq,ssq):d,f,s;endsetsdata:N=42 42 48 50 36 36 36 36 36 36 27 75 48 50 42 42 48 50 36 36 36 36 36 36 27 75 48 50 48 50 36 36 27 75 48 50 48 48 50 48 50 48 Lingo求解0-1规划的问题我们用Lingo得到的了一组最优解,但是我们在仔细确认后发现还有其他的最优解,lingo没有给出.难道lingo给出的解不完全?还有 Extended solver steps:0Total solver iterations:0比如Row Sl 一个关于用lingo解二次规划限制条件的问题model:data:H=@file('imageinfo.txt');W=@file('imageinfo.txt');r=@file('imageinfo.txt');c=@file('imageinfo.txt');height=@file('imageinfo.txt');width=@file('imageinfo.txt');Du=0;enddatasets:coordin 自己写的一个lingo程序解决二次规划的问题为何得不到正确答案model:data:w=@file('size.txt');h=@file('size.txt');wnew=@file('size.txt');hnew=@file('size.txt');tn=@file('size.txt');pn=@file('size.txt');enddatasets:xy/1..2/;index/1