param n:=4;
param t;
set N:=1..n;
set SQ:= 1..t;
set Q{s in SQ} within N;
param c{i in N, j in N};
var x{i in N,j in N}binary;
minimize fc: sum{i in N, j in N}(c[i,j]*x[i,j]);
subject to CICLE3{s in SQ}: sum{i in Q[s],j in N diff Q[s]}x[i,j]>=1;
subject to INPUT {j in N:j>1}:sum{i in N:i<>j}x[i,j]=1;
subject to OUTPUT {i in N:i>1}:sum{j in N:i<>j}x[i,j]=1;
end;
data;
param t:=14;
set Q[1]:=1;
set Q[2]:=2;
set Q[3]:=3;
set Q[4]:=4;
set Q[5]:=1,2;
set Q[6]:=1,3;
set Q[7]:=1,4;
set Q[8]:=2,3;
set Q[9]:=2,4;
set Q[10]:=3,4;
set Q[11]:=1,2,3;
set Q[12]:=1,2,4;
set Q[13]:=1,3,4;
set Q[14]:=2,3,4;
param c:1 2 3 4:=
1 0 105 255 655
2 100 0 415 450
3 250 410 0 330
4 650 420 300 0;
end;
Problem: lab31
Rows: 21
Columns: 12 (12 integer, 12 binary)
Non-zeros: 78
Status: INTEGER OPTIMAL
Objective: fc = 1105 (MINimum) 1105 (LP)
No. Row name Activity Lower bound Upper bound
------ ------------ ------------- ------------- -------------
1 fc 1105
2 CICLE3[1] 1 1
3 CICLE3[2] 1 1
4 CICLE3[3] 1 1
5 CICLE3[4] 1 1
6 CICLE3[5] 1 1
7 CICLE3[6] 1 1
8 CICLE3[7] 2 1
9 CICLE3[8] 2 1
10 CICLE3[9] 1 1
11 CICLE3[10] 1 1
12 CICLE3[11] 1 1
13 CICLE3[12] 1 1
14 CICLE3[13] 1 1
15 CICLE3[14] 1 1
16 INPUT[2] 1 1 =
17 INPUT[3] 1 1 =
18 INPUT[4] 1 1 =
19 OUTPUT[2] 1 1 =
20 OUTPUT[3] 1 1 =
21 OUTPUT[4] 1 1 =
No. Column name Activity Lower bound Upper bound
------ ------------ ------------- ------------- -------------
1 x[1,2] * 1 0 1
2 x[1,3] * 0 0 1
3 x[1,4] * 0 0 1
4 x[2,1] * 0 0 1
5 x[2,3] * 0 0 1
6 x[2,4] * 1 0 1
7 x[3,1] * 1 0 1
8 x[3,2] * 0 0 1
9 x[3,4] * 0 0 1
10 x[4,1] * 0 0 1
11 x[4,2] * 0 0 1
12 x[4,3] * 1 0 1
Integer feasibility conditions:
INT.PE: max.abs.err. = 0.00e+000 on row 0
max.rel.err. = 0.00e+000 on row 0
High quality
INT.PB: max.abs.err. = 0.00e+000 on row 0
max.rel.err. = 0.00e+000 on row 0
High quality
End of output