39 lines
1.5 KiB
Plaintext
39 lines
1.5 KiB
Plaintext
|
GLPSOL: GLPK LP/MIP Solver, v4.65
|
||
|
|
Parameter(s) specified in the command line:
|
||
|
|
-m exo2/personnel.mod -d exo2/personnel.dat -o exo2/personnel.sol
|
||
|
|
Reading model section from exo2/personnel.mod...
|
||
|
|
33 lines were read
|
||
|
|
Reading data section from exo2/personnel.dat...
|
||
|
|
27 lines were read
|
||
|
|
Generating RespectUnTravailParPersonne...
|
||
|
|
Generating RespectUnePersonneParTravail...
|
||
|
|
Generating CoutTotal...
|
||
|
|
Model has been successfully generated
|
||
|
|
GLPK Integer Optimizer, v4.65
|
||
|
|
9 rows, 16 columns, 48 non-zeros
|
||
|
|
16 integer variables, all of which are binary
|
||
|
|
Preprocessing...
|
||
|
|
8 rows, 16 columns, 32 non-zeros
|
||
|
|
16 integer variables, all of which are binary
|
||
|
|
Scaling...
|
||
|
|
A: min|aij| = 1.000e+00 max|aij| = 1.000e+00 ratio = 1.000e+00
|
||
|
|
Problem data seem to be well scaled
|
||
|
|
Constructing initial basis...
|
||
|
|
Size of triangular part is 7
|
||
|
|
Solving LP relaxation...
|
||
|
|
GLPK Simplex Optimizer, v4.65
|
||
|
|
8 rows, 16 columns, 32 non-zeros
|
||
|
|
0: obj = 1.900000000e+01 inf = 2.000e+00 (1)
|
||
|
|
4: obj = 1.100000000e+01 inf = 0.000e+00 (0)
|
||
|
|
* 10: obj = 4.000000000e+00 inf = 0.000e+00 (0)
|
||
|
|
OPTIMAL LP SOLUTION FOUND
|
||
|
|
Integer optimization begins...
|
||
|
|
Long-step dual simplex will be used
|
||
|
|
+ 10: mip = not found yet >= -inf (1; 0)
|
||
|
|
+ 10: >>>>> 4.000000000e+00 >= 4.000000000e+00 0.0% (1; 0)
|
||
|
|
+ 10: mip = 4.000000000e+00 >= tree is empty 0.0% (0; 1)
|
||
|
|
INTEGER OPTIMAL SOLUTION FOUND
|
||
|
|
Time used: 0.0 secs
|
||
|
|
Memory used: 0.1 Mb (151199 bytes)
|
||
|
|
Writing MIP solution to 'exo2/personnel.sol'...
|