lingo两次求和modelsets:p1/1..4/:b;p2/1..4/;link(p2,p1):x,v;endse

来源：学生作业帮编辑：作业帮分类：综合作业时间：2024/07/06 01:56:05

lingo两次求和
model
sets:
p1/1..4/:b;
p2/1..4/;
link(p2,p1):x,v;
endsets
data:
v=2800 4500 6000 7300
2800 4500 6000 7300
2800 4500 6000 7300
2800 4500 6000 7300 ;
b=15,10,20,12;
enddata
min=@sum(link:x*v);
@sum(p1(i):(@sum p2(j):x(i,j)))

看看是不是这样.
model:
sets:
p1/1..4/:b;
p2/1..4/;
link(p2,p1):x,v;
endsets
data:
v=2800 4500 6000 7300
2800 4500 6000 7300
2800 4500 6000 7300
2800 4500 6000 7300 ;
b=15,10,20,12;
enddata
min=@sum(link:x*v);
@for(p1(i):@sum(p2(j):x(i,j))
再问： model: sets: p1/1..4/:b; p2/1..4/; p3/1..4/:k; link(p1,p2):x,v; endsets data: v=2800 4500 6000 7300 2800 4500 6000 7300 2800 4500 6000 7300 2800 4500 6000 7300 ; b=15,10,20,12; enddata min=@sum(p1(i):@sum( p2(j):x(i,j)*v(i,j))); @for(p1(i):@sum (p3(k):@sum (p2(j):x(x+1-k,j)))>=b(i)); @for(link:@gin(x)); end 三次累加呢。这个呢···
再答：数据是二维的何来三次累加。。。
再问： ∑（i=1到4） ( ∑(k=1到i) ∑(k到4)x(i+1-k,j)>=b(i) ) 多了一个K怎么解？
再答： model: sets: p1/1..4/:b; p2/1..4/; p3/1..4/:k; link(p1,p2):x,v; endsets data: v=2800 4500 6000 7300 2800 4500 6000 7300 2800 4500 6000 7300 2800 4500 6000 7300 ; b=15,10,20,12; enddata min=@sum(p1(i):@sum( p2(j):x(i,j)*v(i,j))); @for(p1(i):@sum (p3(k)|k#le#i:@sum (p2(j):x(i+1-k,j)))>=b(i)); @for(link:@gin(x)); end
再问：如何让 j=(k到4）??
再答： @for(p1(i):@sum (p3(k)|k#le#i:@sum (p2(j)|j#ge#k:x(i+1-k,j)))>=b(i));

lingo错误modelsets:xiaodi/1..4/:b;chandi/1..3/:a;link(chandi,x 设p1,p2,p3为三个质数,且p2=p1+4,p3=p1+8 ,求证：p1=3 设p1,p2,p3为三个质数,且p2=p1+4,p3=p1+8,求证p1=3 p2->next=p1;p2=p1; int *p1=malloc(4); int *p2=malloc(4); printf("p2-p1=%d\n",p2 p1 p2是什么 while(*p1) p1++; while(*p2) { *p1=*p2; p1++; p2++; } *p1=0; 已知P1(a-2,4)和P2(2,b-1)关于x轴对称,求a,b的值. int *p1,*p2; p1=(int *)malloc(10); p2=p1+2; printf("p1=0x%x, 若点P(a,b)关于y轴对称点是P1,且P1关于x轴的对称点是P2,P2的坐标为（-3,4）,求a,b的值已知p1（3,4),p2（0,0) 则|p1p2| #include void swap(int b[]) { int *p,*p1,*p2； p1=&b[0] ；p2=&