>D:\glpk\gusek\glpsol.exe --cover --clique --gomory --mir -m "_lt_lotsizing.mod"    
GLPSOL: GLPK LP/MIP Solver, v4.65
Parameter(s) specified in the command line:
 --cover --clique --gomory --mir -m _lt_lotsizing.mod
Reading model section from _lt_lotsizing.mod...
Reading data section from _lt_lotsizing.mod...
161 lines were read
Generating sum_xj...
Generating sum_yk...
Generating x_min_x...
Generating x_x_max...
Generating y_min_y...
Generating y_y_max...
Generating x_on...
Generating balance...
Generating x_up0...
Generating x_up1...
Generating y_up0...
Generating y_up1...
Generating s_u...
Generating v_u...
Generating v_sum...
Generating w_sum...
Generating u_0...
Generating y_0...
Generating y_I...
Generating totalcost...
Model has been successfully generated
GLPK Integer Optimizer, v4.65
184 rows, 110 columns, 399 non-zeros
110 integer variables, 55 of which are binary
Preprocessing...
7 hidden covering inequaliti(es) were detected
11 constraint coefficient(s) were reduced
124 rows, 104 columns, 286 non-zeros
104 integer variables, 51 of which are binary
Scaling...
 A: min|aij| =  1.000e+00  max|aij| =  1.800e+02  ratio =  1.800e+02
GM: min|aij| =  2.730e-01  max|aij| =  3.663e+00  ratio =  1.342e+01
EQ: min|aij| =  7.454e-02  max|aij| =  1.000e+00  ratio =  1.342e+01
2N: min|aij| =  6.250e-02  max|aij| =  1.250e+00  ratio =  2.000e+01
Constructing initial basis...
Size of triangular part is 124
Solving LP relaxation...
GLPK Simplex Optimizer, v4.65
124 rows, 104 columns, 286 non-zeros
      0: obj =   3.970000000e+02 inf =   7.606e+01 (27)
     32: obj =   3.674583333e+03 inf =   0.000e+00 (0)
*    47: obj =   6.279375000e+02 inf =   0.000e+00 (0)
OPTIMAL LP SOLUTION FOUND
Integer optimization begins...
Long-step dual simplex will be used
Gomory's cuts enabled
MIR cuts enabled
Cover cuts enabled
Number of 0-1 knapsack inequalities = 15
Clique cuts enabled
Constructing conflict graph...
Conflict graph has 36 + 10 = 46 vertices
+    47: mip =     not found yet >=              -inf        (1; 0)
Cuts on level 0: gmi = 14;
Solution found by heuristic: 888
+   165: mip =   8.880000000e+02 >=     tree is empty   0.0% (0; 15)
INTEGER OPTIMAL SOLUTION FOUND
Time used:   0.0 secs
Memory used: 0.5 Mb (476255 bytes)

  u,   x,   y;
  1,  80,  30;
  0,   0,   0;
  1,  60,   0;
  1,  80,  30;
  0,   0, -10;
  1,  59,  -1;
  1,  57,  -4;
  1,  57,   3;
  1,  57,   0;

Total Cost:        888

Model has been successfully processed
>Exit code: 0    Time: 0.605