Mathematical modeling 2004b question (transmission problem)

One 、lingo Code

model: 

sets:
mach /1..8/:  v;
time /1..10/ ;
mt(mach, time): a, x, n, p;
endsets

data:
a = 
70,	0,	50,	0,	0,	30,	0,	0,	0,	40,
30,	0,	20,	8,	15,	6,	2,	0,	0,	8,
110,	0,	40,	0,	30,	0,	20,	40,	0,	40,
55,	5,	10,	10,	10,	10,	15,	0,	0,	1,
75,	5,	15,	0,	15,	15,	0,	10,	10,	10,
95,	0,	10,	20,	0,	15,	10,	20,	0,	10,
50,	15,	5,	15,	10,	10,	5,	10,	3,	2,
70,	0,	20,	0,	20,	0,	20,	10,	15,	5;

p = 
-505,	0,	124,	168,	210,	252,	312,	330,	363,	489,
-560,	0,	182,	203,	245,	300,	320,	360,	410,	495,
-610,	0,	152,	189,	233,	258,	308,	356,	415,	500,
-500,	150,	170,	200,	255,	302,	325,	380,	435,	800,
-590,	0,	116,	146,	188,	215,	250,	310,	396,	510,
-607,	0,	159,	173,	205,	252,	305,	380,	405,	520,
-500,	120,	180,	251,	260,	306,	315,	335,	348,	548,
-800,	153,	183,	233,	253,	283,	303,	318,	400,	800;

v = 2.2, 1, 3.2, 1.3, 1.8, 2, 1.4, 1.8;
enddata

! xi1  Is the fixed value ;
@for(mt(i,j): x(i, 1) = a(i,1));

@for(mt(i,j): x(i, 2) = a(i,2));

@for(mt(i,j)|j#ge#2 #and# j#le#9: x(i, j+1) <= x(i,j)+15*v(i));

@for(mt(i,j)|j#ge#2 #and# j#le#9: x(i, j+1) >= x(i,j)-15*v(i));

!  And for 982.4;
@sum(mt(i, j): x(i,j)) = 982.4;

!  xij <= aij;
@for(mt(i, j) : x(i, j) <= a(i, j));

!  xij >= 0;
@for(mt(i, j) : x(i, j) >= 0);

!   If xij = 0,nij = 0, otherwise  nij = 1;
@for(mt(i, j) : n(i, j) = @if(x(i, j)#eq#0, 0, 1));

@for(mt : @bin(n));



!  The goal is ;
c = @max(mt(i, j)  : p(i, j)*n(i, j));

min  = c;

end

Two 、 experimental result

3、 ... and 、 Be careful

lingo Solve local optimal solution by default , You need to set up and solve the global optimal solution as follows