>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...
63 lines were read
Generating totalcost...
Generating balance...
Generating p_on...
Generating i_0...
Generating i_T...
Model has been successfully generated
GLPK Integer Optimizer, v4.65
43 rows, 61 columns, 161 non-zeros
20 integer variables, all of which are binary
Preprocessing...
39 rows, 53 columns, 91 non-zeros
15 integer variables, all of which are binary
Scaling...
 A: min|aij| =  1.000e+00  max|aij| =  4.000e+01  ratio =  4.000e+01
GM: min|aij| =  1.000e+00  max|aij| =  1.000e+00  ratio =  1.000e+00
EQ: min|aij| =  1.000e+00  max|aij| =  1.000e+00  ratio =  1.000e+00
2N: min|aij| =  7.500e-01  max|aij| =  1.313e+00  ratio =  1.750e+00
Constructing initial basis...
Size of triangular part is 39
Solving LP relaxation...
GLPK Simplex Optimizer, v4.65
39 rows, 53 columns, 91 non-zeros
      0: obj =   2.261000000e+03 inf =   1.740e+02 (14)
     15: obj =   2.969892857e+03 inf =   0.000e+00 (0)
*    30: obj =   2.919535714e+03 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
No 0-1 knapsack inequalities detected
Clique cuts enabled
Constructing conflict graph...
No conflicts found
+    30: mip =     not found yet >=              -inf        (1; 0)
Cuts on level 0: gmi = 5; mir = 7;
+    39: >>>>>   2.958000000e+03 >=   2.958000000e+03   0.0% (1; 0)
+    39: mip =   2.958000000e+03 >=     tree is empty   0.0% (0; 1)
INTEGER OPTIMAL SOLUTION FOUND
Time used:   0.0 secs
Memory used: 0.2 Mb (213459 bytes)


//Input data for Online Solver at https://www.lutanho.net/plt/lotsize.html
//I u_0 y_0 y_I
   20; 0; 0; 0;
startup x_min fix var x_max demand y_min fix var y_max
    0;     0,  25,  5,  20;   12;     0,  0,  6, 9999;
    0;     0,  30,  3,  15;    6;     0,  0,  5, 9999;
    0;     0,  40,  7,   5;   20;     0,  0,  4, 9999;
    0;     0,  20,  2,  30;    5;     0,  0,  5, 9999;
    0;     0,  80,  1,  20;    7;     0,  0,  6, 9999;
    0;     0,  80, 10,  20;   25;     0,  0,  9, 9999;
    0;     0, 150, 15,  21;    0;     0,  0,  9, 9999;
    0;     0,  30,  2,  10;    5;     0,  0,  6, 9999;
    0;     0,  45,  1,  10;    5;     0,  0,  5, 9999;
    0;     0,  60,  5,   5;   21;     0,  0,  4, 9999;
    0;     0,  30,  1,   0;    9;     0,  0,  5, 9999;
    0;     0,  90, 10,  12;    5;     0,  0,  6, 9999;
    0;     0,  80, 15,  20;   27;     0,  0,  9, 9999;
    0;     0, 150,  2,   5;    0;     0,  0,  9, 9999;
    0;     0,  25,  1,  20;    5;     0,  0,  6, 9999;
    0;     0,  20, 10,   5;   20;     0,  0,  5, 9999;
    0;     0,  30,  1,  40;    5;     0,  0,  4, 9999;
    0;     0,  40,  5,  20;   10;     0,  0,  5, 9999;
    0;     0,  20,  1,  10;    5;     0,  0,  6, 9999;
    0;     0,  80, 10,  20;   25;     0,  0,  9, 9999;

--------------------------------------------------------------------
Total Cost:       2958

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