param m:= 5;
param m:= 5;
set M:=1..m;
param n:=3;
set N:=1..n;
param a {i in M};
param b {j in N};
param c {i in M};
param d {i in M, j in N};
param e {i in M};
var x{i in M, j in N}>=0 integer;
var y {i in M} binary;
minimize fc: sum{i in M}e[i]*y[i]+sum{i in M, j in N}(c[i]+d[i,j])*x[i,j];
s.t. ogr1 {j in N}: sum {i in M}x[i,j]>=b[j];
s.t. ogr2 {i in M}:sum {j in N }x[i,j]<=a[i]*y[i];
data;
param a:= 1 450 2 300 3 250 4 750 5 270;
param b:= 1 600 2 500 3 750;
param c:= 1 7 2 3 3 25 4 12 5 30;
param d: 1 2 3 :=
1 200 300 500
2 500 400 600
3 255 345 123
4 578 123 97
5 156 456 650;
param e:=1 500 2 600 3 350 4 900 5 450;
Problem: labor1
Rows: 9
Columns: 20 (20 integer, 5 binary)
Non-zeros: 55
Status: INTEGER OPTIMAL
Objective: fc = 335810 (MINimum) 335470 (LP)
No. Row name Activity Lower bound Upper bound
------ ------------ ------------- ------------- -------------
1 fc 335810
2 ogr1[1] 600 600
3 ogr1[2] 500 500
4 ogr1[3] 750 750
5 ogr2[1] 0 0
6 ogr2[2] -170 0
7 ogr2[3] 0 0
8 ogr2[4] 0 0
9 ogr2[5] 0 0
No. Column name Activity Lower bound Upper bound
------ ------------ ------------- ------------- -------------
1 x[1,1] * 330 0
2 x[1,2] * 120 0
3 x[1,3] * 0 0
4 x[2,1] * 0 0
5 x[2,2] * 130 0
6 x[2,3] * 0 0
7 x[3,1] * 0 0
8 x[3,2] * 0 0
9 x[3,3] * 250 0
10 x[4,1] * 0 0
11 x[4,2] * 250 0
12 x[4,3] * 500 0
13 x[5,1] * 270 0
14 x[5,2] * 0 0
15 x[5,3] * 0 0
16 y[1] * 1 0 1
17 y[2] * 1 0 1
18 y[3] * 1 0 1
19 y[4] * 1 0 1
20 y[5] * 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