Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
GLPSOL: GLPK LP/MIP Solver, v4.65
Parameter(s) specified in the command line:
--lp input.lp
Reading problem data from 'input.lp'...
11 rows, 11 columns, 32 non-zeros
11 integer variables, none of which are binary
29 lines were read
GLPK Integer Optimizer, v4.65
11 rows, 11 columns, 32 non-zeros
11 integer variables, none of which are binary
Preprocessing...
10 rows, 11 columns, 31 non-zeros
11 integer variables, none of which are binary
Scaling...
A: min|aij| = 1.000e+00 max|aij| = 1.790e+02 ratio = 1.790e+02
GM: min|aij| = 3.333e-01 max|aij| = 3.000e+00 ratio = 9.000e+00
EQ: min|aij| = 1.111e-01 max|aij| = 1.000e+00 ratio = 9.000e+00
2N: min|aij| = 1.250e-01 max|aij| = 1.398e+00 ratio = 1.119e+01
Constructing initial basis...
Size of triangular part is 10
Solving LP relaxation...
GLPK Simplex Optimizer, v4.65
10 rows, 11 columns, 31 non-zeros
* 0: obj = -0.000000000e+00 inf = 0.000e+00 (1)
* 11: obj = 8.289275314e+07 inf = 0.000e+00 (0)
OPTIMAL LP SOLUTION FOUND
Integer optimization begins...
Long-step dual simplex will be used
+ 11: mip = not found yet <= +inf (1; 0)
+ 25: >>>>> 8.289275200e+07 <= 8.289275300e+07 < 0.1% (10; 0)
+ 25: mip = 8.289275200e+07 <= tree is empty 0.0% (0; 19)
INTEGER OPTIMAL SOLUTION FOUND
Time used: 0.0 secs
Memory used: 0.1 Mb (70225 bytes)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment