38 lines
1.5 KiB
Plaintext
38 lines
1.5 KiB
Plaintext
GLPSOL: GLPK LP/MIP Solver, v4.65
|
|
Parameter(s) specified in the command line:
|
|
--lp exo1/voitures.lp -o exo1/voitures.sol
|
|
Reading problem data from 'exo1/voitures.lp'...
|
|
3 rows, 2 columns, 5 non-zeros
|
|
2 integer variables, none of which are binary
|
|
21 lines were read
|
|
GLPK Integer Optimizer, v4.65
|
|
3 rows, 2 columns, 5 non-zeros
|
|
2 integer variables, none of which are binary
|
|
Preprocessing...
|
|
2 rows, 2 columns, 4 non-zeros
|
|
2 integer variables, none of which are binary
|
|
Scaling...
|
|
A: min|aij| = 5.000e+00 max|aij| = 2.000e+01 ratio = 4.000e+00
|
|
GM: min|aij| = 8.034e-01 max|aij| = 1.245e+00 ratio = 1.549e+00
|
|
EQ: min|aij| = 6.455e-01 max|aij| = 1.000e+00 ratio = 1.549e+00
|
|
2N: min|aij| = 6.250e-01 max|aij| = 1.250e+00 ratio = 2.000e+00
|
|
Constructing initial basis...
|
|
Size of triangular part is 2
|
|
Solving LP relaxation...
|
|
GLPK Simplex Optimizer, v4.65
|
|
2 rows, 2 columns, 4 non-zeros
|
|
* 0: obj = -0.000000000e+00 inf = 0.000e+00 (2)
|
|
* 3: obj = 1.028571429e+07 inf = 0.000e+00 (0)
|
|
OPTIMAL LP SOLUTION FOUND
|
|
Integer optimization begins...
|
|
Long-step dual simplex will be used
|
|
+ 3: mip = not found yet <= +inf (1; 0)
|
|
Solution found by heuristic: 10282000
|
|
Solution found by heuristic: 10283000
|
|
+ 4: >>>>> 1.028400000e+07 <= 1.028400000e+07 0.0% (2; 0)
|
|
+ 4: mip = 1.028400000e+07 <= tree is empty 0.0% (0; 3)
|
|
INTEGER OPTIMAL SOLUTION FOUND
|
|
Time used: 0.0 secs
|
|
Memory used: 0.1 Mb (62364 bytes)
|
|
Writing MIP solution to 'exo1/voitures.sol'...
|