

25FV47.MPS:

Model name:  '25FV47' - run #1    
Objective:   Minimize(R0000)
 
SUBMITTED
Model size:      821 constraints,    1571 variables,        10400 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          2154 iter.
 
Optimal solution       5501.84588829 after       3171 iter.

Excellent numeric accuracy ||*|| = 6.60805e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 3171, 0 (0.0%) were bound flips.
      There were 33 refactorizations, 0 triggered by time and 30 by density.
       ... on average 96.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6045 NZ entries, 1.3x largest basis.
      The constraint matrix inf-norm is 238.95, with a dynamic range of 1.19475e+006.
      Time to load data was 0.078 seconds, presolve used 0.032 seconds,
       ... 7.515 seconds in simplex solver, in total 7.625 seconds.

Value of objective function: 5501.85
CPU Time for Parsing input: 0.109s (0.109s total since program start)
CPU Time for solving: 7.562s (7.671s total since program start)


80BAU3B.MPS:

Model name:  '80BAU3B' - run #1    
Objective:   Minimize(HOLLY)
 
SUBMITTED
Model size:     2262 constraints,    9799 variables,        21002 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          7059 iter.
 
Optimal solution       987224.192409 after       7188 iter.

Excellent numeric accuracy ||*|| = 2.27374e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 7188, 3343 (46.5%) were bound flips.
      There were 17 refactorizations, 0 triggered by time and 0 by density.
       ... on average 226.2 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 7662 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 104.74, with a dynamic range of 476091.
      Time to load data was 0.281 seconds, presolve used 0.078 seconds,
       ... 34.063 seconds in simplex solver, in total 34.422 seconds.

Value of objective function: 987224
CPU Time for Parsing input: 0.281s (0.281s total since program start)
CPU Time for solving: 34.14s (34.421s total since program start)


ADLITTLE.MPS:

Model name:  'ADLITTLE' - run #1    
Objective:   Minimize(.Z....)
 
SUBMITTED
Model size:       56 constraints,      97 variables,          383 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after            55 iter.
 
Optimal solution       225494.963162 after         82 iter.

Excellent numeric accuracy ||*|| = 2.27374e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 82, 0 (0.0%) were bound flips.
      There were 5 refactorizations, 0 triggered by time and 3 by density.
       ... on average 16.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 261 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 64.3, with a dynamic range of 53583.3.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.016 seconds in simplex solver, in total 0.032 seconds.

Value of objective function: 225495
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.015s (0.046s total since program start)


AFIRO.MPS:

Model name:  'AFIRO' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:       27 constraints,      32 variables,           83 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after             9 iter.
 
Optimal solution      -464.753142857 after         20 iter.

Excellent numeric accuracy ||*|| = 1.42109e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 20, 0 (0.0%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 0 by density.
       ... on average 10.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 49 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 2.429, with a dynamic range of 22.7009.
      Time to load data was 0.015 seconds, presolve used 0.000 seconds,
       ... 0.000 seconds in simplex solver, in total 0.015 seconds.

Value of objective function: -464.753
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0s (0.046s total since program start)


AGG.MPS:

Model name:  'AGG' - run #1    
Objective:   Minimize(OBJECTIV)
 
SUBMITTED
Model size:      488 constraints,     163 variables,         2410 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after            66 iter.
 
Optimal solution      -35991767.2866 after        103 iter.

Excellent numeric accuracy ||*|| = 4.65661e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 103, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 2 by density.
       ... on average 25.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1634 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 424, with a dynamic range of 2.12e+007.
      Time to load data was 0.032 seconds, presolve used 0.015 seconds,
       ... 0.078 seconds in simplex solver, in total 0.125 seconds.

Value of objective function: -3.59918e+007
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.094s (0.125s total since program start)


AGG2.MPS:

Model name:  'AGG2' - run #1    
Objective:   Minimize(OBJECTIV)
 
SUBMITTED
Model size:      516 constraints,     302 variables,         4284 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after            39 iter.
 
Optimal solution       -20239252.356 after        167 iter.

Excellent numeric accuracy ||*|| = 1.16415e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 167, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 2 by density.
       ... on average 41.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1953 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 424, with a dynamic range of 2.12e+007.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.125 seconds in simplex solver, in total 0.172 seconds.

Value of objective function: -2.02393e+007
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.141s (0.187s total since program start)


AGG3.MPS:

Model name:  'AGG3' - run #1    
Objective:   Minimize(OBJECTIV)
 
SUBMITTED
Model size:      516 constraints,     302 variables,         4300 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after            42 iter.
 
Optimal solution       10312115.9351 after        170 iter.

Excellent numeric accuracy ||*|| = 2.21917e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 170, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 2 by density.
       ... on average 42.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1864 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 424, with a dynamic range of 2.12e+007.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.140 seconds in simplex solver, in total 0.187 seconds.

Value of objective function: 1.03121e+007
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.157s (0.203s total since program start)


BANDM.MPS:

Model name:  'BANDM' - run #1    
Objective:   Minimize(....1)
 
SUBMITTED
Model size:      305 constraints,     472 variables,         2494 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           504 iter.
 
Optimal solution       -158.62801845 after        666 iter.

Excellent numeric accuracy ||*|| = 1.42109e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 666, 0 (0.0%) were bound flips.
      There were 12 refactorizations, 0 triggered by time and 9 by density.
       ... on average 55.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2266 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 200, with a dynamic range of 200000.
      Time to load data was 0.031 seconds, presolve used 0.015 seconds,
       ... 0.438 seconds in simplex solver, in total 0.484 seconds.

Value of objective function: -158.628
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.453s (0.484s total since program start)


BEACONFD.MPS:

Model name:  'BEACONFD' - run #1    
Objective:   Minimize(11CSTR)
 
SUBMITTED
Model size:      173 constraints,     262 variables,         3375 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       33592.4858072 after        121 iter.

Reasonable numeric accuracy ||*|| = 8.07617e-009 (rel. error 3.09597e-014)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 121, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 40.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 953 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 500, with a dynamic range of 416667.
      Time to load data was 0.046 seconds, presolve used 0.000 seconds,
       ... 0.047 seconds in simplex solver, in total 0.093 seconds.

Value of objective function: 33592.5
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.047s (0.093s total since program start)


BLEND.MPS:

Model name:  'BRUCE' - run #1    
Objective:   Minimize(C)
 
SUBMITTED
Model size:       74 constraints,      83 variables,          491 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -30.8121498458 after         96 iter.

Excellent numeric accuracy ||*|| = 3.55271e-015

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 96, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 4 by density.
       ... on average 24.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 472 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 66, with a dynamic range of 22000.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.015 seconds in simplex solver, in total 0.031 seconds.

Value of objective function: -30.8121
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.016s (0.031s total since program start)


BNL1.MPS:

Model name:  'BNL1' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:      643 constraints,    1175 variables,         5121 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           968 iter.
 
Optimal solution       1977.62956152 after        968 iter.

Excellent numeric accuracy ||*|| = 2.84217e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 968, 0 (0.0%) were bound flips.
      There were 10 refactorizations, 0 triggered by time and 7 by density.
       ... on average 96.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2694 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 78, with a dynamic range of 70909.1.
      Time to load data was 0.047 seconds, presolve used 0.016 seconds,
       ... 1.344 seconds in simplex solver, in total 1.407 seconds.

Value of objective function: 1977.63
CPU Time for Parsing input: 0.062s (0.062s total since program start)
CPU Time for solving: 1.359s (1.421s total since program start)


BNL2.MPS:

Model name:  'BNL2' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:     2324 constraints,    3489 variables,        13999 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1903 iter.
 
Optimal solution       1811.23654036 after       2115 iter.

Excellent numeric accuracy ||*|| = 2.06057e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2115, 0 (0.0%) were bound flips.
      There were 10 refactorizations, 0 triggered by time and 0 by density.
       ... on average 211.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6993 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 78, with a dynamic range of 130000.
      Time to load data was 0.157 seconds, presolve used 0.062 seconds,
       ... 8.078 seconds in simplex solver, in total 8.297 seconds.

Value of objective function: 1811.24
CPU Time for Parsing input: 0.156s (0.156s total since program start)
CPU Time for solving: 8.14s (8.296s total since program start)


BOEING1.MPS:

Model name:  'FLAPINTL' - run #1    
Objective:   Minimize(OBJECTIV)
 
SUBMITTED
Model size:      351 constraints,     384 variables,         3485 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           353 iter.
 
Optimal solution      -335.213567507 after        581 iter.

Excellent numeric accuracy ||*|| = 1.13687e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 581, 110 (18.9%) were bound flips.
      There were 7 refactorizations, 0 triggered by time and 4 by density.
       ... on average 67.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2219 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 3102.58, with a dynamic range of 274080.
      Time to load data was 0.031 seconds, presolve used 0.000 seconds,
       ... 0.360 seconds in simplex solver, in total 0.391 seconds.

Value of objective function: -335.214
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.36s (0.406s total since program start)


BOEING2.MPS:

Model name:  'BOEING2' - run #1    
Objective:   Minimize(OBJECTIV)
 
SUBMITTED
Model size:      166 constraints,     143 variables,         1196 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           138 iter.
 
Optimal solution      -315.018728015 after        172 iter.

Excellent numeric accuracy ||*|| = 1.42109e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 172, 42 (24.4%) were bound flips.
      There were 5 refactorizations, 0 triggered by time and 2 by density.
       ... on average 26.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 711 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 3000, with a dynamic range of 300000.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.046 seconds in simplex solver, in total 0.062 seconds.

Value of objective function: -315.019
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.047s (0.078s total since program start)


BORE3D.MPS:

Model name:  'BORE3D' - run #1    
Objective:   Minimize(FAT0..J.)
 
SUBMITTED
Model size:      233 constraints,     315 variables,         1429 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1373.08039421 after        200 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 200, 3 (1.5%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 4 by density.
       ... on average 49.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1037 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1426.9, with a dynamic range of 1.4269e+007.
      Time to load data was 0.016 seconds, presolve used 0.015 seconds,
       ... 0.078 seconds in simplex solver, in total 0.109 seconds.

Value of objective function: 1373.08
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.094s (0.109s total since program start)


BRANDY.MPS:

Model name:  'BRANDY' - run #1    
Objective:   Minimize(10000A)
 
SUBMITTED
Model size:      220 constraints,     249 variables,         2148 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1518.50989649 after        273 iter.

Excellent numeric accuracy ||*|| = 3.7943e-012

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 273, 0 (0.0%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 6 by density.
       ... on average 45.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1446 NZ entries, 1.2x largest basis.
      The constraint matrix inf-norm is 203.7, with a dynamic range of 254625.
      Time to load data was 0.031 seconds, presolve used 0.000 seconds,
       ... 0.125 seconds in simplex solver, in total 0.156 seconds.

Value of objective function: 1518.51
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.125s (0.171s total since program start)


CAPRI.MPS:

Model name:  'CAPRI' - run #1    
Objective:   Minimize(OBJEC)
 
SUBMITTED
Model size:      271 constraints,     353 variables,         1767 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           334 iter.
 
Optimal solution       2690.01291377 after        343 iter.

Excellent numeric accuracy ||*|| = 8.59091e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 343, 75 (21.9%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 3 by density.
       ... on average 44.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1245 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 217.745, with a dynamic range of 2.41939e+006.
      Time to load data was 0.016 seconds, presolve used 0.015 seconds,
       ... 0.110 seconds in simplex solver, in total 0.141 seconds.

Value of objective function: 2690.01
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.125s (0.156s total since program start)


CYCLE.MPS:

Model name:  'CYCLE' - run #1    
Objective:   Minimize(B...FR..)
 
SUBMITTED
Model size:     1903 constraints,    2857 variables,        20720 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -5.22639302489 after       1914 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1914, 0 (0.0%) were bound flips.
      There were 8 refactorizations, 0 triggered by time and 4 by density.
       ... on average 239.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 8284 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 910.618, with a dynamic range of 9.10618e+007.
      Time to load data was 0.156 seconds, presolve used 0.047 seconds,
       ... 6.875 seconds in simplex solver, in total 7.078 seconds.

Value of objective function: -5.22639
CPU Time for Parsing input: 0.171s (0.171s total since program start)
CPU Time for solving: 6.922s (7.093s total since program start)


CZPROB.MPS:

Model name:  'CZPROB' - run #1    
Objective:   Minimize(..COST)
 
SUBMITTED
Model size:      929 constraints,    3523 variables,        10669 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1499 iter.
 
Optimal solution       2185196.69886 after       2259 iter.

Excellent numeric accuracy ||*|| = 2.27374e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2259, 0 (0.0%) were bound flips.
      There were 11 refactorizations, 0 triggered by time and 0 by density.
       ... on average 205.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3539 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 137, with a dynamic range of 87261.1.
      Time to load data was 0.094 seconds, presolve used 0.046 seconds,
       ... 6.047 seconds in simplex solver, in total 6.187 seconds.

Value of objective function: 2.1852e+006
CPU Time for Parsing input: 0.093s (0.093s total since program start)
CPU Time for solving: 6.094s (6.187s total since program start)


D2Q06C.MPS:

Model name:  'D2Q06C' - run #1    
Objective:   Minimize(R0000)
 
SUBMITTED
Model size:     2171 constraints,    5167 variables,        32417 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          7590 iter.

lp_solve optimization was stopped due to time-out.
 
Optimal solution         122891.6751 after       8499 iter.

Excellent numeric accuracy ||*|| = 1.27329e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 8499, 0 (0.0%) were bound flips.
      There were 48 refactorizations, 0 triggered by time and 37 by density.
       ... on average 177.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 18632 NZ entries, 1.3x largest basis.
      The constraint matrix inf-norm is 2322.7, with a dynamic range of 1.16135e+007.
      Time to load data was 0.250 seconds, presolve used 0.093 seconds,
       ... 59.922 seconds in simplex solver, in total 60.265 seconds.
Suboptimal solution

Value of objective function: 122892
CPU Time for Parsing input: 0.25s (0.25s total since program start)
CPU Time for solving: 60.015s (60.265s total since program start)


D6CUBE.MPS:

Model name:  'D6CUBE' - run #1    
Objective:   Minimize(1)
 
SUBMITTED
Model size:      415 constraints,    6184 variables,        37704 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       315.491666667 after       1185 iter.

Excellent numeric accuracy ||*|| = 3.75167e-012

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1185, 0 (0.0%) were bound flips.
      There were 23 refactorizations, 0 triggered by time and 23 by density.
       ... on average 51.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 5331 NZ entries, 1.8x largest basis.
      The constraint matrix inf-norm is 360, with a dynamic range of 360.
      Time to load data was 0.172 seconds, presolve used 0.141 seconds,
       ... 8.500 seconds in simplex solver, in total 8.813 seconds.

Value of objective function: 315.492
CPU Time for Parsing input: 0.171s (0.171s total since program start)
CPU Time for solving: 8.641s (8.812s total since program start)


DEGEN2.MPS:

Model name:  'DEGEN2' - run #1    
Objective:   Minimize(OBJ.ROW)
 
SUBMITTED
Model size:      444 constraints,     534 variables,         3978 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           666 iter.
 
Optimal solution           -1435.178 after       1239 iter.

Excellent numeric accuracy ||*|| = 2.06501e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1239, 0 (0.0%) were bound flips.
      There were 11 refactorizations, 0 triggered by time and 8 by density.
       ... on average 112.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3317 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 1.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 1.141 seconds in simplex solver, in total 1.188 seconds.

Value of objective function: -1435.18
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 1.156s (1.187s total since program start)


DEGEN3.MPS:

Model name:  'DEGEN3' - run #1    
Objective:   Minimize(OBJ.ROW)
 
SUBMITTED
Model size:     1503 constraints,    1818 variables,        24646 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          2645 iter.

lp_solve optimization was stopped due to time-out.
 
Optimal solution  -3.80223790206e+031 after       9926 iter.
check_solution: Variable   X00217C =            -1e+030 is below its lower bound                  0
check_solution: Variable   X00226C = -5.95514857359e+028 is below its lower bound                  0
check_solution: Variable   X00239A =            -1e+030 is below its lower bound                  0
check_solution: Variable   X00244B =            -1e+030 is below its lower bound                  0
check_solution: Variable   X00259B =            -1e+030 is below its lower bound                  0
check_solution: Variable   X00260B = -1.75138993974e+021 is below its lower bound                  0
check_solution: Variable   X00315A =            -1e+030 is below its lower bound                  0
check_solution: Variable   X00315B =            -1e+030 is below its lower bound                  0
check_solution: Variable   X00323C =            -1e+030 is below its lower bound                  0
check_solution: Variable   X00332B =            -1e+030 is below its lower bound                  0

Seriously low accuracy found ||*|| = 8.49814e+030 (rel. error 1.80383e+030)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 9926, 0 (0.0%) were bound flips.
      There were 56 refactorizations, 0 triggered by time and 6 by density.
       ... on average 177.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 18153 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 1.
      Time to load data was 0.110 seconds, presolve used 0.078 seconds,
       ... 59.953 seconds in simplex solver, in total 60.141 seconds.
Timeout
CPU Time for Parsing input: 0.125s (0.125s total since program start)
CPU Time for solving: 60.031s (60.156s total since program start)


DFL001.MPS:

Model name:  'DFL001' - run #1    
Objective:   Minimize(NIL)
 
SUBMITTED
Model size:     6071 constraints,   12230 variables,        35632 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
 
Optimal solution        6699554.7525 after       5701 iter.
check_solution: Variable   C00007 =     -37.9999999997 is below its lower bound                  0
check_solution: Variable   C00010 =     -20.4999999997 is below its lower bound                  0
check_solution: Variable   C00020 =     -202.749999999 is below its lower bound                  0
check_solution: Variable   C00026 =                 -1 is below its lower bound                  0
check_solution: Variable   C00028 =                 -1 is below its lower bound                  0
check_solution: Variable   C00030 =     -187.749999999 is below its lower bound                  0
check_solution: Variable   C00049 =     -5.99999999999 is below its lower bound                  0
check_solution: Variable   C00053 =                -11 is below its lower bound                  0
check_solution: Variable   C00063 =     -7.99999999999 is below its lower bound                  0
check_solution: Variable   C00073 =     -17.5833333332 is below its lower bound                  0

Seriously low accuracy found ||*|| = 339.25 (rel. error 1.38029e+011)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 5701, 2 (0.0%) were bound flips.
      There were 22 refactorizations, 0 triggered by time and 0 by density.
       ... on average 259.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 18008 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 2, with a dynamic range of 24.
      Time to load data was 0.360 seconds, presolve used 0.156 seconds,
       ... 59.875 seconds in simplex solver, in total 60.391 seconds.
Timeout
CPU Time for Parsing input: 0.375s (0.375s total since program start)
CPU Time for solving: 60.031s (60.406s total since program start)


E226.MPS:

Model name:  'E226' - run #1    
Objective:   Minimize(...000)
 
SUBMITTED
Model size:      223 constraints,     282 variables,         2578 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after            87 iter.
 
Optimal solution      -25.8649290664 after        355 iter.

Excellent numeric accuracy ||*|| = 1.35003e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 355, 0 (0.0%) were bound flips.
      There were 8 refactorizations, 0 triggered by time and 6 by density.
       ... on average 44.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1449 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 1486.2, with a dynamic range of 5.71615e+006.
      Time to load data was 0.015 seconds, presolve used 0.016 seconds,
       ... 0.203 seconds in simplex solver, in total 0.234 seconds.

Value of objective function: -25.8649
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.219s (0.25s total since program start)


ETAMACRO.MPS:

Model name:  'ETAMACRO' - run #1    
Objective:   Minimize(OPTIMALG)
 
SUBMITTED
Model size:      400 constraints,     688 variables,         2409 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           491 iter.
 
Optimal solution      -755.715233375 after        681 iter.

Excellent numeric accuracy ||*|| = 5.68434e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 681, 67 (9.8%) were bound flips.
      There were 9 refactorizations, 0 triggered by time and 6 by density.
       ... on average 68.2 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1357 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 2000, with a dynamic range of 105263.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.437 seconds in simplex solver, in total 0.484 seconds.

Value of objective function: -755.715
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.453s (0.484s total since program start)


FFFFF800.MPS:

Model name:  'FFFFF800' - run #1    
Objective:   Minimize(..COST..)
 
SUBMITTED
Model size:      524 constraints,     854 variables,         6227 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       555679.564818 after        824 iter.

Reasonable numeric accuracy ||*|| = 3.43425e-009 (rel. error 1.66515e-011)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 824, 0 (0.0%) were bound flips.
      There were 9 refactorizations, 0 triggered by time and 8 by density.
       ... on average 91.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3079 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 108985, with a dynamic range of 1.36231e+007.
      Time to load data was 0.047 seconds, presolve used 0.015 seconds,
       ... 0.891 seconds in simplex solver, in total 0.953 seconds.

Value of objective function: 555680
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.907s (0.953s total since program start)


FINNIS.MPS:

Model name:  'PTABLES3' - run #1    
Objective:   Minimize(PRICER)
 
SUBMITTED
Model size:      497 constraints,     614 variables,         2310 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           413 iter.
 
Optimal solution       172791.065596 after        495 iter.

Excellent numeric accuracy ||*|| = 9.09495e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 495, 21 (4.2%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 3 by density.
       ... on average 79.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1614 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 32, with a dynamic range of 69414.3.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.375 seconds in simplex solver, in total 0.422 seconds.

Value of objective function: 172791
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.391s (0.437s total since program start)


FIT1D.MPS:

Model name:  'FIT1D' - run #1    
Objective:   Minimize(PENALTY)
 
SUBMITTED
Model size:       24 constraints,    1026 variables,        13404 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -9146.37809242 after       1073 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1073, 997 (92.9%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 25.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 206 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1890, with a dynamic range of 189000.
      Time to load data was 0.063 seconds, presolve used 0.031 seconds,
       ... 0.563 seconds in simplex solver, in total 0.657 seconds.

Value of objective function: -9146.38
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 0.593s (0.671s total since program start)


FIT1P.MPS:

Model name:  'FIT1P' - run #1    
Objective:   Minimize(PENALTY)
 
SUBMITTED
Model size:      627 constraints,    1677 variables,         9868 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       9146.37809242 after       1331 iter.

Reasonable numeric accuracy ||*|| = 1.04593e-009 (rel. error 1.18323e-011)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1331, 365 (27.4%) were bound flips.
      There were 8 refactorizations, 0 triggered by time and 8 by density.
       ... on average 120.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 7707 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1890, with a dynamic range of 189000.
      Time to load data was 0.063 seconds, presolve used 0.031 seconds,
       ... 2.110 seconds in simplex solver, in total 2.204 seconds.

Value of objective function: 9146.38
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 2.14s (2.218s total since program start)


FIT2D.MPS:

Model name:  'FIT2D' - run #1    
Objective:   Minimize(PENALTY)
 
SUBMITTED
Model size:       25 constraints,   10500 variables,       129018 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -68464.2932938 after      11211 iter.

Excellent numeric accuracy ||*|| = 2.91024e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 11211, 11048 (98.5%) were bound flips.
      There were 5 refactorizations, 0 triggered by time and 5 by density.
       ... on average 32.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 335 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 2564, with a dynamic range of 51280.
      Time to load data was 0.578 seconds, presolve used 0.344 seconds,
       ... 47.203 seconds in simplex solver, in total 48.125 seconds.

Value of objective function: -68464.3
CPU Time for Parsing input: 0.578s (0.578s total since program start)
CPU Time for solving: 47.547s (48.125s total since program start)


FIT2P.MPS:

Model name:  'FIT2P' - run #1    
Objective:   Minimize(PENALTY)
 
SUBMITTED
Model size:     3000 constraints,   13525 variables,        50284 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
 
Optimal solution       58555.9511882 after      13332 iter.
check_solution: Variable   CONSTANT =     -104.303215352 is below its lower bound                  0
check_solution: Variable   X0000002 =      -47.428884438 is below its lower bound                  0
check_solution: Variable   X0000004 =     -3.99151406873 is below its lower bound                  0
check_solution: Variable   X0000007 =     -25.6488702646 is below its lower bound                  0
check_solution: Variable   X0000008 =     -1.16117188392 is below its lower bound                  0
check_solution: Variable   X0000010 =     -5.76593556397 is below its lower bound                  0
check_solution: Variable   X0000011 =     -1.75880391733 is below its lower bound                  0
check_solution: Variable   X0000012 =   -0.0338250248511 is below its lower bound                  0
check_solution: Variable   X0000014 =     -28.4508872327 is below its lower bound                  0
check_solution: Variable   X0000016 =      -15.791663109 is below its lower bound                  0

Seriously low accuracy found ||*|| = 621.326 (rel. error 621.326)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 13332, 10727 (80.5%) were bound flips.
      There were 11 refactorizations, 0 triggered by time and 6 by density.
       ... on average 236.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 42029 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 2564, with a dynamic range of 51280.
      Time to load data was 0.437 seconds, presolve used 0.172 seconds,
       ... 59.859 seconds in simplex solver, in total 60.468 seconds.
Timeout
CPU Time for Parsing input: 0.437s (0.437s total since program start)
CPU Time for solving: 60.031s (60.468s total since program start)


FORPLAN.MPS:

Model name:  'FORPLAN1' - run #1    
Objective:   Minimize(OB1PNW20)
 
SUBMITTED
Model size:      161 constraints,     421 variables,         4563 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           309 iter.
 
Optimal solution      -664.218961272 after        393 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 393, 0 (0.0%) were bound flips.
      There were 11 refactorizations, 0 triggered by time and 8 by density.
       ... on average 35.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1095 NZ entries, 1.2x largest basis.
      The constraint matrix inf-norm is 2800, with a dynamic range of 378890.
      Time to load data was 0.047 seconds, presolve used 0.000 seconds,
       ... 0.235 seconds in simplex solver, in total 0.282 seconds.

Value of objective function: -664.219
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.235s (0.281s total since program start)


GANGES.MPS:

Model name:  'GANGES' - run #1    
Objective:   Minimize(OBJ99)
 
SUBMITTED
Model size:     1309 constraints,    1681 variables,         6912 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -109585.736129 after       1537 iter.

Excellent numeric accuracy ||*|| = 2.10207e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1537, 299 (19.5%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 0 by density.
       ... on average 309.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 4710 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 714.286.
      Time to load data was 0.062 seconds, presolve used 0.032 seconds,
       ... 2.125 seconds in simplex solver, in total 2.219 seconds.

Value of objective function: -109586
CPU Time for Parsing input: 0.062s (0.062s total since program start)
CPU Time for solving: 2.156s (2.218s total since program start)


GFRDPNC.MPS:

Model name:  'GFRD-PNC' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:      616 constraints,    1092 variables,         2377 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       6902235.99955 after        730 iter.

Excellent numeric accuracy ||*|| = 9.09495e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 730, 187 (25.6%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 181.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1647 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1095.2, with a dynamic range of 1095.2.
      Time to load data was 0.046 seconds, presolve used 0.000 seconds,
       ... 0.625 seconds in simplex solver, in total 0.671 seconds.

Value of objective function: 6.90224e+006
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.625s (0.671s total since program start)


GREENBEA.MPS:

Model name:  'GREENBEA' - run #1    
Objective:   Minimize(FAT0..J.)
 
SUBMITTED
Model size:     2392 constraints,    5405 variables,        30877 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          9006 iter.

lp_solve optimization was stopped due to time-out.
 
Optimal solution      -51350963.1024 after       9986 iter.

Marginal numeric accuracy ||*|| = 1.47179e-007 (rel. error 3.45967e-016)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 9986, 492 (4.9%) were bound flips.
      There were 44 refactorizations, 0 triggered by time and 22 by density.
       ... on average 215.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 15623 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 100, with a dynamic range of 1.66667e+006.
      Time to load data was 0.219 seconds, presolve used 0.094 seconds,
       ... 59.921 seconds in simplex solver, in total 60.234 seconds.
Suboptimal solution

Value of objective function: -5.1351e+007
CPU Time for Parsing input: 0.234s (0.234s total since program start)
CPU Time for solving: 60.016s (60.25s total since program start)


GREENBEB.MPS:

Model name:  'GREENBEB' - run #1    
Objective:   Minimize(FAT0..J.)
 
SUBMITTED
Model size:     2392 constraints,    5405 variables,        30877 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
lp_solve unsuccessful after 9396 iter and a last best value of 1e+030

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 9396, 556 (5.9%) were bound flips.
      There were 43 refactorizations, 0 triggered by time and 32 by density.
       ... on average 205.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 16087 NZ entries, 1.2x largest basis.
      The constraint matrix inf-norm is 100, with a dynamic range of 1.66667e+006.
      Time to load data was 0.219 seconds, presolve used 0.093 seconds,
       ... 59.922 seconds in simplex solver, in total 60.234 seconds.
Timeout
CPU Time for Parsing input: 0.234s (0.234s total since program start)
CPU Time for solving: 60.016s (60.25s total since program start)


GROW15.MPS:

Model name:  'GROW15' - run #1    
Objective:   Minimize(REVENUE)
 
SUBMITTED
Model size:      300 constraints,     645 variables,         5620 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -106870941.294 after        859 iter.

Marginal numeric accuracy ||*|| = 8.04367e-007 (rel. error 1.16306e-009)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 859, 4 (0.5%) were bound flips.
      There were 16 refactorizations, 0 triggered by time and 16 by density.
       ... on average 53.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 5083 NZ entries, 1.4x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 166667.
      Time to load data was 0.047 seconds, presolve used 0.015 seconds,
       ... 0.985 seconds in simplex solver, in total 1.047 seconds.

Value of objective function: -1.06871e+008
CPU Time for Parsing input: 0.062s (0.062s total since program start)
CPU Time for solving: 1s (1.062s total since program start)


GROW22.MPS:

Model name:  'GROW22' - run #1    
Objective:   Minimize(REVENUE)
 
SUBMITTED
Model size:      440 constraints,     946 variables,         8252 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -160834336.483 after       1310 iter.

Reasonable numeric accuracy ||*|| = 1.01068e-009 (rel. error 6.81723e-014)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1310, 9 (0.7%) were bound flips.
      There were 21 refactorizations, 0 triggered by time and 21 by density.
       ... on average 62.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 7923 NZ entries, 1.4x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 166667.
      Time to load data was 0.110 seconds, presolve used 0.015 seconds,
       ... 2.235 seconds in simplex solver, in total 2.360 seconds.

Value of objective function: -1.60834e+008
CPU Time for Parsing input: 0.125s (0.125s total since program start)
CPU Time for solving: 2.25s (2.375s total since program start)


GROW7.MPS:

Model name:  'GROW7' - run #1    
Objective:   Minimize(REVENUE)
 
SUBMITTED
Model size:      140 constraints,     301 variables,         2612 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -47787811.8147 after        343 iter.

Excellent numeric accuracy ||*|| = 2.7967e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 343, 4 (1.2%) were bound flips.
      There were 11 refactorizations, 0 triggered by time and 11 by density.
       ... on average 30.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2310 NZ entries, 1.5x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 166667.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.187 seconds in simplex solver, in total 0.234 seconds.

Value of objective function: -4.77878e+007
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.203s (0.234s total since program start)


ISRAEL.MPS:

Model name:  'ISRAEL' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:      174 constraints,     142 variables,         2269 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after             7 iter.
 
Optimal solution      -896644.821863 after        192 iter.

Excellent numeric accuracy ||*|| = 6.54832e-012

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 192, 0 (0.0%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 4 by density.
       ... on average 32.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1676 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1600, with a dynamic range of 1.6e+006.
      Time to load data was 0.031 seconds, presolve used 0.000 seconds,
       ... 0.109 seconds in simplex solver, in total 0.140 seconds.

Value of objective function: -896645
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.109s (0.14s total since program start)


KB2.MPS:

Model name:  'KB2' - run #1    
Objective:   Minimize(FAT7..J.)
 
SUBMITTED
Model size:       43 constraints,      41 variables,          286 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -1749.90012991 after         51 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 51, 7 (13.7%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 2 by density.
       ... on average 22.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 253 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 113, with a dynamic range of 664.706.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.016 seconds in simplex solver, in total 0.032 seconds.

Value of objective function: -1749.9
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.016s (0.031s total since program start)


LOTFI.MPS:

Model name:  'LOTFI' - run #1    
Objective:   Minimize(1)
 
SUBMITTED
Model size:      153 constraints,     308 variables,         1078 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           241 iter.
 
Optimal solution      -25.2647060619 after        276 iter.

Excellent numeric accuracy ||*|| = 9.31323e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 276, 0 (0.0%) were bound flips.
      There were 10 refactorizations, 0 triggered by time and 7 by density.
       ... on average 27.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 514 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 1000, with a dynamic range of 52083.3.
      Time to load data was 0.000 seconds, presolve used 0.016 seconds,
       ... 0.093 seconds in simplex solver, in total 0.109 seconds.

Value of objective function: -25.2647
CPU Time for Parsing input: 0s (0s total since program start)
CPU Time for solving: 0.109s (0.109s total since program start)


MAROS.MPS:

Model name:  'MAROS' - run #1    
Objective:   Minimize(REVENUE1)
 
SUBMITTED
Model size:      846 constraints,    1443 variables,         9614 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1262 iter.
Found feasibility by dual simplex after          2273 iter.
 
Optimal solution      -58063.7437011 after       2273 iter.

Excellent numeric accuracy ||*|| = 4.65661e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2273, 0 (0.0%) were bound flips.
      There were 20 refactorizations, 0 triggered by time and 16 by density.
       ... on average 113.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 4866 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 16838.4, with a dynamic range of 1.68384e+008.
      Time to load data was 0.078 seconds, presolve used 0.032 seconds,
       ... 4.265 seconds in simplex solver, in total 4.375 seconds.

Value of objective function: -58063.7
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 4.297s (4.375s total since program start)


MAROS-R7.MPS:

Model name:  'MAROS-R7' - run #1    
Objective:   Minimize(R0)
 
SUBMITTED
Model size:     3136 constraints,    9408 variables,       144848 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
 
Optimal solution       212915.257337 after       2692 iter.
check_solution: Variable   X10 =     -644.259641814 is below its lower bound                  0
check_solution: Variable   X23 =     -1278.17200171 is below its lower bound                  0
check_solution: Variable   X31 =     -164.609144428 is below its lower bound                  0
check_solution: Variable   X32 =     -750.601530698 is below its lower bound                  0
check_solution: Variable   X39 =     -757.643389147 is below its lower bound                  0
check_solution: Variable   X75 =     -3088.39233635 is below its lower bound                  0
check_solution: Variable   X79 =     -761.458413636 is below its lower bound                  0
check_solution: Variable   X100 =     -2.24017445642 is below its lower bound                  0
check_solution: Variable   X101 =     -290.337950923 is below its lower bound                  0
check_solution: Variable   X116 =     -890.108653258 is below its lower bound                  0

Seriously low accuracy found ||*|| = 4.43591e+006 (rel. error 949766)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2692, 0 (0.0%) were bound flips.
      There were 38 refactorizations, 0 triggered by time and 16 by density.
       ... on average 70.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 202491 NZ entries, 1.8x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 598.086.
      Time to load data was 1.031 seconds, presolve used 0.375 seconds,
       ... 59.672 seconds in simplex solver, in total 61.078 seconds.
Timeout
CPU Time for Parsing input: 1.031s (1.031s total since program start)
CPU Time for solving: 60.047s (61.078s total since program start)


MODSZK1.MPS:

Model name:  'MODSZK1' - run #1    
Objective:   Minimize(OBJ.FUNC)
 
SUBMITTED
Model size:      687 constraints,    1620 variables,         3168 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       320.619729065 after        678 iter.

Excellent numeric accuracy ||*|| = 2.91038e-011

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 678, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 226.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2126 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1.19001, with a dynamic range of 1608.12.
      Time to load data was 0.047 seconds, presolve used 0.015 seconds,
       ... 0.860 seconds in simplex solver, in total 0.922 seconds.

Value of objective function: 320.62
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.875s (0.921s total since program start)


NESM.MPS:

Model name:  'NESM' - run #1    
Objective:   Minimize(SHORTAGE)
 
SUBMITTED
Model size:      662 constraints,    2923 variables,        13288 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          7753 iter.
 
Optimal solution       14076036.4876 after       7948 iter.

Excellent numeric accuracy ||*|| = 2.16005e-011

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 7948, 5662 (71.2%) were bound flips.
      There were 16 refactorizations, 0 triggered by time and 13 by density.
       ... on average 142.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3039 NZ entries, 1.3x largest basis.
      The constraint matrix inf-norm is 33.3333, with a dynamic range of 33333.3.
      Time to load data was 0.110 seconds, presolve used 0.047 seconds,
       ... 9.531 seconds in simplex solver, in total 9.688 seconds.

Value of objective function: 1.4076e+007
CPU Time for Parsing input: 0.125s (0.125s total since program start)
CPU Time for solving: 9.578s (9.703s total since program start)


PEROLD.MPS:

Model name:  'PILOT1' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:      625 constraints,    1376 variables,         6018 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1378 iter.
 
Optimal solution      -9380.75527824 after       2076 iter.

Reasonable numeric accuracy ||*|| = 2.82125e-009 (rel. error 2.62478e-014)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2076, 337 (16.2%) were bound flips.
      There were 27 refactorizations, 0 triggered by time and 24 by density.
       ... on average 64.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6097 NZ entries, 1.8x largest basis.
      The constraint matrix inf-norm is 23614.6, with a dynamic range of 4.45559e+008.
      Time to load data was 0.047 seconds, presolve used 0.031 seconds,
       ... 3.453 seconds in simplex solver, in total 3.531 seconds.

Value of objective function: -9380.76
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 3.485s (3.531s total since program start)


PILOT4.MPS:

Model name:  'PILOT4' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:      410 constraints,    1000 variables,         5141 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           388 iter.
 
Optimal solution      -2581.13925888 after        839 iter.

Excellent numeric accuracy ||*|| = 7.567e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 839, 71 (8.5%) were bound flips.
      There were 14 refactorizations, 0 triggered by time and 11 by density.
       ... on average 54.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 5081 NZ entries, 1.5x largest basis.
      The constraint matrix inf-norm is 27844, with a dynamic range of 7.5254e+008.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 1.141 seconds in simplex solver, in total 1.188 seconds.

Value of objective function: -2581.14
CPU Time for Parsing input: 0.062s (0.062s total since program start)
CPU Time for solving: 1.156s (1.218s total since program start)


PILOT87.MPS:

Model name:  'PILOT87' - run #1    
Objective:   Minimize(EENDCAP)
 
SUBMITTED
Model size:     2030 constraints,    4883 variables,        73152 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
lp_solve unsuccessful after 12601 iter and a last best value of 1e+030

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 12601, 7950 (63.1%) were bound flips.
      There were 44 refactorizations, 0 triggered by time and 36 by density.
       ... on average 105.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 32861 NZ entries, 2.0x largest basis.
      The constraint matrix inf-norm is 1000, with a dynamic range of 1e+009.
      Time to load data was 0.468 seconds, presolve used 0.188 seconds,
       ... 59.828 seconds in simplex solver, in total 60.484 seconds.
Timeout
CPU Time for Parsing input: 0.468s (0.468s total since program start)
CPU Time for solving: 60.016s (60.484s total since program start)


PILOTJA.MPS:

Model name:  'PILOT.JA' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:      940 constraints,    1988 variables,        14698 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           993 iter.
 
Optimal solution      -6113.13646558 after       2553 iter.

Marginal numeric accuracy ||*|| = 1.50019e-007 (rel. error 8.32069e-011)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2553, 149 (5.8%) were bound flips.
      There were 28 refactorizations, 0 triggered by time and 25 by density.
       ... on average 85.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 8958 NZ entries, 1.7x largest basis.
      The constraint matrix inf-norm is 5.85114e+006, with a dynamic range of 2.92557e+012.
      Time to load data was 0.110 seconds, presolve used 0.031 seconds,
       ... 7.265 seconds in simplex solver, in total 7.406 seconds.

Value of objective function: -6113.14
CPU Time for Parsing input: 0.109s (0.109s total since program start)
CPU Time for solving: 7.297s (7.406s total since program start)


PILOTNOV.MPS:

Model name:  'PILOTS' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:      975 constraints,    2172 variables,        13057 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           874 iter.
 
Optimal solution      -4497.27618822 after       1228 iter.

Excellent numeric accuracy ||*|| = 9.31323e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1228, 58 (4.7%) were bound flips.
      There were 13 refactorizations, 0 triggered by time and 10 by density.
       ... on average 90.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6821 NZ entries, 1.4x largest basis.
      The constraint matrix inf-norm is 5.85114e+006, with a dynamic range of 2.92557e+012.
      Time to load data was 0.093 seconds, presolve used 0.032 seconds,
       ... 2.890 seconds in simplex solver, in total 3.015 seconds.

Value of objective function: -4497.28
CPU Time for Parsing input: 0.109s (0.109s total since program start)
CPU Time for solving: 2.922s (3.031s total since program start)


PILOTS.MPS:

Model name:  'PILOTS' - run #1    
Objective:   Minimize(ENDCAP)
 
SUBMITTED
Model size:     1441 constraints,    3652 variables,        43167 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
lp_solve unsuccessful after 11512 iter and a last best value of 1e+030

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 11512, 4999 (43.4%) were bound flips.
      There were 61 refactorizations, 0 triggered by time and 57 by density.
       ... on average 106.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 36460 NZ entries, 2.3x largest basis.
      The constraint matrix inf-norm is 145.6, with a dynamic range of 1.456e+008.
      Time to load data was 0.328 seconds, presolve used 0.109 seconds,
       ... 59.907 seconds in simplex solver, in total 60.344 seconds.
Timeout
CPU Time for Parsing input: 0.328s (0.328s total since program start)
CPU Time for solving: 60.015s (60.343s total since program start)


PILOTWE.MPS:

Model name:  'PILOT.WE' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:      722 constraints,    2789 variables,         9126 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           635 iter.
 
Optimal solution      -2720107.53284 after       2450 iter.

Marginal numeric accuracy ||*|| = 6.87021e-007 (rel. error 3.01041e-011)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2450, 56 (2.3%) were bound flips.
      There were 29 refactorizations, 0 triggered by time and 26 by density.
       ... on average 82.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 5472 NZ entries, 1.8x largest basis.
      The constraint matrix inf-norm is 47950.9, with a dynamic range of 3.35321e+008.
      Time to load data was 0.078 seconds, presolve used 0.032 seconds,
       ... 6.906 seconds in simplex solver, in total 7.016 seconds.

Value of objective function: -2.72011e+006
CPU Time for Parsing input: 0.093s (0.093s total since program start)
CPU Time for solving: 6.938s (7.031s total since program start)


QAP12.MPS:

Model name:  'QAP12' - run #1    
Objective:   Minimize(NOBJ)
 
SUBMITTED
Model size:     3192 constraints,    8856 variables,        38304 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
 
Optimal solution       357.999999999 after       3815 iter.
check_solution: Variable   X003 =   -0.0574037949369 is below its lower bound                  0
check_solution: Variable   X005 =    -0.627730093661 is below its lower bound                  0
check_solution: Variable   X009 =    -0.487478060485 is below its lower bound                  0
check_solution: Variable   X010 =    -0.430194983098 is below its lower bound                  0
check_solution: Variable   X013 =   -0.0355993054804 is below its lower bound                  0
check_solution: Variable   X019 =    -0.329639666121 is below its lower bound                  0
check_solution: Variable   X022 =    -0.382708742195 is below its lower bound                  0
check_solution: Variable   X031 =     -1.48882547552 is below its lower bound                  0
check_solution: Variable   X033 =    -0.991576602473 is below its lower bound                  0
check_solution: Variable   X035 =     -0.30372324302 is below its lower bound                  0

Seriously low accuracy found ||*|| = 9.16282 (rel. error 9.16282)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 3815, 0 (0.0%) were bound flips.
      There were 36 refactorizations, 0 triggered by time and 35 by density.
       ... on average 106.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 72766 NZ entries, 4.6x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 1.
      Time to load data was 0.281 seconds, presolve used 0.141 seconds,
       ... 59.890 seconds in simplex solver, in total 60.312 seconds.
Timeout
CPU Time for Parsing input: 0.281s (0.281s total since program start)
CPU Time for solving: 60.031s (60.312s total since program start)


QAP15.MPS:

Model name:  'QAP15' - run #1    
Objective:   Minimize(NOBJ)
 
SUBMITTED
Model size:     6330 constraints,   22275 variables,        94950 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 

lp_solve optimization was stopped due to time-out.
 
Optimal solution                 212 after       2532 iter.
check_solution: Variable   X011 =    -0.325610393345 is below its lower bound                  0
check_solution: Variable   X013 =    -0.170327582063 is below its lower bound                  0
check_solution: Variable   X014 =    -0.251691803154 is below its lower bound                  0
check_solution: Variable   X018 =    -0.640548642928 is below its lower bound                  0
check_solution: Variable   X020 =    -0.210833754705 is below its lower bound                  0
check_solution: Variable   X034 =    -0.313017599631 is below its lower bound                  0
check_solution: Variable   X039 =   -0.0385573003991 is below its lower bound                  0
check_solution: Variable   X045 =    -0.110192643055 is below its lower bound                  0
check_solution: Variable   X048 =    -0.796868359325 is below its lower bound                  0
check_solution: Variable   X054 =    -0.188297033063 is below its lower bound                  0

Seriously low accuracy found ||*|| = 12.5484 (rel. error 6.3559)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2532, 0 (0.0%) were bound flips.
      There were 15 refactorizations, 0 triggered by time and 12 by density.
       ... on average 168.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 48863 NZ entries, 2.5x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 1.
      Time to load data was 0.812 seconds, presolve used 0.328 seconds,
       ... 59.750 seconds in simplex solver, in total 60.890 seconds.
Timeout
CPU Time for Parsing input: 0.828s (0.828s total since program start)
CPU Time for solving: 60.078s (60.906s total since program start)


QAP8.MPS:

Model name:  'QAP8' - run #1    
Objective:   Minimize(NOBJ)
 
SUBMITTED
Model size:      912 constraints,    1632 variables,         7296 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution               203.5 after       8631 iter.

Excellent numeric accuracy ||*|| = 1.33227e-015

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 8631, 0 (0.0%) were bound flips.
      There were 143 refactorizations, 0 triggered by time and 143 by density.
       ... on average 60.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 11123 NZ entries, 2.6x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 1.
      Time to load data was 0.047 seconds, presolve used 0.031 seconds,
       ... 27.937 seconds in simplex solver, in total 28.015 seconds.

Value of objective function: 203.5
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 27.969s (28.015s total since program start)


RECIPE.MPS:

Model name:  'RECIPE' - run #1    
Objective:   Minimize(FAT...J.)
 
SUBMITTED
Model size:       91 constraints,     180 variables,          663 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution            -266.616 after         55 iter.

Excellent numeric accuracy ||*|| = 3.55271e-015

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 55, 11 (20.0%) were bound flips.
      There were 0 refactorizations, 0 triggered by time and 0 by density.
       ... on average 44.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 92 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 145, with a dynamic range of 1208.33.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.016 seconds in simplex solver, in total 0.032 seconds.

Value of objective function: -266.616
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.016s (0.031s total since program start)


SC105.MPS:

Model name:  'SC105' - run #1    
Objective:   Minimize(MAXIM)
 
SUBMITTED
Model size:      105 constraints,     103 variables,          280 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -52.2020612117 after        100 iter.

Excellent numeric accuracy ||*|| = 1.98952e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 100, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 4 by density.
       ... on average 25.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 372 NZ entries, 1.4x largest basis.
      The constraint matrix inf-norm is 2, with a dynamic range of 20.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.031 seconds in simplex solver, in total 0.047 seconds.

Value of objective function: -52.2021
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.031s (0.046s total since program start)


SC205.MPS:

Model name:  'SC205' - run #1    
Objective:   Minimize(MAXIM)
 
SUBMITTED
Model size:      205 constraints,     203 variables,          551 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -52.2020612117 after        228 iter.

Excellent numeric accuracy ||*|| = 5.82645e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 228, 0 (0.0%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 6 by density.
       ... on average 38.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 796 NZ entries, 1.5x largest basis.
      The constraint matrix inf-norm is 2, with a dynamic range of 20.
      Time to load data was 0.000 seconds, presolve used 0.000 seconds,
       ... 0.078 seconds in simplex solver, in total 0.078 seconds.

Value of objective function: -52.2021
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.078s (0.093s total since program start)


SC50A.MPS:

Model name:  'SC50A' - run #1    
Objective:   Minimize(MAXIM)
 
SUBMITTED
Model size:       50 constraints,      48 variables,          130 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      -64.5750770586 after         46 iter.

Excellent numeric accuracy ||*|| = 8.52651e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 46, 0 (0.0%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 2 by density.
       ... on average 23.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 162 NZ entries, 1.3x largest basis.
      The constraint matrix inf-norm is 2, with a dynamic range of 20.
      Time to load data was 0.000 seconds, presolve used 0.000 seconds,
       ... 0.015 seconds in simplex solver, in total 0.015 seconds.

Value of objective function: -64.5751
CPU Time for Parsing input: 0s (0s total since program start)
CPU Time for solving: 0.015s (0.015s total since program start)


SC50B.MPS:

Model name:  'SC50B' - run #1    
Objective:   Minimize(MAXIM)
 
SUBMITTED
Model size:       50 constraints,      48 variables,          118 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution                 -70 after         52 iter.

Excellent numeric accuracy ||*|| = 1.13687e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 52, 0 (0.0%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 2 by density.
       ... on average 26.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 138 NZ entries, 1.2x largest basis.
      The constraint matrix inf-norm is 3, with a dynamic range of 10.
      Time to load data was 0.015 seconds, presolve used 0.000 seconds,
       ... 0.016 seconds in simplex solver, in total 0.031 seconds.

Value of objective function: -70
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.016s (0.031s total since program start)


SCAGR25.MPS:

Model name:  'SCAGR25' - run #1    
Objective:   Minimize(FOB00001)
 
SUBMITTED
Model size:      471 constraints,     500 variables,         1554 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           546 iter.
 
Optimal solution      -14753433.0608 after        743 iter.

Excellent numeric accuracy ||*|| = 1.81899e-012

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 743, 0 (0.0%) were bound flips.
      There were 10 refactorizations, 0 triggered by time and 7 by density.
       ... on average 74.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2037 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 9.32, with a dynamic range of 46.6.
      Time to load data was 0.015 seconds, presolve used 0.016 seconds,
       ... 0.578 seconds in simplex solver, in total 0.609 seconds.

Value of objective function: -1.47534e+007
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.594s (0.625s total since program start)


SCAGR7.MPS:

Model name:  'SCAGR7' - run #1    
Objective:   Minimize(FOB00001)
 
SUBMITTED
Model size:      129 constraints,     140 variables,          420 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           100 iter.
 
Optimal solution      -2331389.82433 after        173 iter.

Excellent numeric accuracy ||*|| = 1.36424e-012

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 173, 0 (0.0%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 3 by density.
       ... on average 28.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 468 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 9.32, with a dynamic range of 46.6.
      Time to load data was 0.016 seconds, presolve used 0.015 seconds,
       ... 0.032 seconds in simplex solver, in total 0.063 seconds.

Value of objective function: -2.33139e+006
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.047s (0.062s total since program start)


SCFXM1.MPS:

Model name:  'SCFXM1' - run #1    
Objective:   Minimize(.COSTA)
 
SUBMITTED
Model size:      330 constraints,     457 variables,         2589 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           443 iter.
 
Optimal solution       18416.7590283 after        498 iter.

Excellent numeric accuracy ||*|| = 2.27374e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 498, 0 (0.0%) were bound flips.
      There were 8 refactorizations, 0 triggered by time and 6 by density.
       ... on average 62.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1433 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 130, with a dynamic range of 260000.
      Time to load data was 0.032 seconds, presolve used 0.000 seconds,
       ... 0.312 seconds in simplex solver, in total 0.344 seconds.

Value of objective function: 18416.8
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.312s (0.343s total since program start)


SCFXM2.MPS:

Model name:  'SCFXM2' - run #1    
Objective:   Minimize(.COSTA)
 
SUBMITTED
Model size:      660 constraints,     914 variables,         5183 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1165 iter.
 
Optimal solution        36660.261565 after       1338 iter.

Excellent numeric accuracy ||*|| = 4.54747e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1338, 0 (0.0%) were bound flips.
      There were 14 refactorizations, 0 triggered by time and 11 by density.
       ... on average 95.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3004 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 130, with a dynamic range of 260000.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 1.578 seconds in simplex solver, in total 1.625 seconds.

Value of objective function: 36660.3
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 1.594s (1.625s total since program start)


SCFXM3.MPS:

Model name:  'SCFXM3' - run #1    
Objective:   Minimize(.COSTA)
 
SUBMITTED
Model size:      990 constraints,    1371 variables,         7777 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1475 iter.
 
Optimal solution       54901.2545498 after       1622 iter.

Excellent numeric accuracy ||*|| = 2.27374e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1622, 0 (0.0%) were bound flips.
      There were 11 refactorizations, 0 triggered by time and 8 by density.
       ... on average 147.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 4413 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 130, with a dynamic range of 260000.
      Time to load data was 0.062 seconds, presolve used 0.031 seconds,
       ... 2.657 seconds in simplex solver, in total 2.750 seconds.

Value of objective function: 54901.3
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 2.687s (2.765s total since program start)


SCORPION.MPS:

Model name:  'SCORPION' - run #1    
Objective:   Minimize(C9999)
 
SUBMITTED
Model size:      388 constraints,     358 variables,         1426 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1878.12482274 after        337 iter.

Excellent numeric accuracy ||*|| = 8.32667e-017

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 337, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 112.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1635 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 100.
      Time to load data was 0.032 seconds, presolve used 0.015 seconds,
       ... 0.157 seconds in simplex solver, in total 0.204 seconds.

Value of objective function: 1878.12
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.172s (0.203s total since program start)


SCRS8.MPS:

Model name:  'SCRS8' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:      490 constraints,    1169 variables,         3182 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           489 iter.
 
Optimal solution       904.296953801 after        489 iter.

Excellent numeric accuracy ||*|| = 2.84217e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 489, 0 (0.0%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 4 by density.
       ... on average 81.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1479 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 388.765, with a dynamic range of 388765.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.500 seconds in simplex solver, in total 0.547 seconds.

Value of objective function: 904.297
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.516s (0.562s total since program start)


SCSD1.MPS:

Model name:  'SCSD1' - run #1    
Objective:   Minimize(50000000)
 
SUBMITTED
Model size:       77 constraints,     760 variables,         2388 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       8.66666667433 after         84 iter.

Excellent numeric accuracy ||*|| = 8.88178e-016

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 84, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 28.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 299 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 4.12311.
      Time to load data was 0.032 seconds, presolve used 0.015 seconds,
       ... 0.047 seconds in simplex solver, in total 0.094 seconds.

Value of objective function: 8.66667
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.063s (0.109s total since program start)


SCSD6.MPS:

Model name:  'SCSD6' - run #1    
Objective:   Minimize(50000000)
 
SUBMITTED
Model size:      147 constraints,    1350 variables,         4316 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       50.5000000771 after        359 iter.

Excellent numeric accuracy ||*|| = 2.22045e-016

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 359, 0 (0.0%) were bound flips.
      There were 10 refactorizations, 0 triggered by time and 10 by density.
       ... on average 35.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 687 NZ entries, 1.2x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 4.12311.
      Time to load data was 0.047 seconds, presolve used 0.016 seconds,
       ... 0.390 seconds in simplex solver, in total 0.453 seconds.

Value of objective function: 50.5
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.407s (0.453s total since program start)


SCSD8.MPS:

Model name:  'SCSD8' - run #1    
Objective:   Minimize(50000000)
 
SUBMITTED
Model size:      397 constraints,    2750 variables,         8584 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       904.999999925 after       1071 iter.

Excellent numeric accuracy ||*|| = 6.21725e-015

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1071, 0 (0.0%) were bound flips.
      There were 14 refactorizations, 0 triggered by time and 14 by density.
       ... on average 76.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1992 NZ entries, 1.3x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 4.12311.
      Time to load data was 0.078 seconds, presolve used 0.047 seconds,
       ... 2.219 seconds in simplex solver, in total 2.344 seconds.

Value of objective function: 905
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 2.265s (2.343s total since program start)


SCTAP1.MPS:

Model name:  'SCTAP1' - run #1    
Objective:   Minimize(OBJZZZZZ)
 
SUBMITTED
Model size:      300 constraints,     480 variables,         1692 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution             1412.25 after        267 iter.

Excellent numeric accuracy ||*|| = 6.39488e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 267, 0 (0.0%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 2 by density.
       ... on average 133.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 631 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 80, with a dynamic range of 80.
      Time to load data was 0.031 seconds, presolve used 0.000 seconds,
       ... 0.125 seconds in simplex solver, in total 0.156 seconds.

Value of objective function: 1412.25
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.125s (0.156s total since program start)


SCTAP2.MPS:

Model name:  'SCTAP2' - run #1    
Objective:   Minimize(OBJZZZZZ)
 
SUBMITTED
Model size:     1090 constraints,    1880 variables,         6714 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1724.80714286 after        859 iter.

Excellent numeric accuracy ||*|| = 4.49418e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 859, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 1 by density.
       ... on average 286.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1779 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 80, with a dynamic range of 80.
      Time to load data was 0.062 seconds, presolve used 0.032 seconds,
       ... 1.406 seconds in simplex solver, in total 1.500 seconds.

Value of objective function: 1724.81
CPU Time for Parsing input: 0.062s (0.062s total since program start)
CPU Time for solving: 1.438s (1.5s total since program start)


SCTAP3.MPS:

Model name:  'SCTAP3' - run #1    
Objective:   Minimize(OBJZZZZZ)
 
SUBMITTED
Model size:     1480 constraints,    2480 variables,         8874 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution                1424 after       1051 iter.

Excellent numeric accuracy ||*|| = 1.59872e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1051, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 0 by density.
       ... on average 262.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2559 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 80, with a dynamic range of 80.
      Time to load data was 0.063 seconds, presolve used 0.031 seconds,
       ... 2.266 seconds in simplex solver, in total 2.360 seconds.

Value of objective function: 1424
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 2.297s (2.375s total since program start)


SEBA.MPS:

Model name:  'SEBA' - run #1    
Objective:   Minimize(00000000)
 
SUBMITTED
Model size:      515 constraints,    1028 variables,         4352 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution             15711.6 after        439 iter.

Excellent numeric accuracy ||*|| = 1.42109e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 439, 1 (0.2%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 2 by density.
       ... on average 219.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2011 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 156, with a dynamic range of 156.
      Time to load data was 0.046 seconds, presolve used 0.016 seconds,
       ... 0.344 seconds in simplex solver, in total 0.406 seconds.

Value of objective function: 15711.6
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.36s (0.406s total since program start)


SHARE1B.MPS:

Model name:  'SHARE1B' - run #1    
Objective:   Minimize(000000)
 
SUBMITTED
Model size:      117 constraints,     225 variables,         1151 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           219 iter.
 
Optimal solution      -76589.3185792 after        298 iter.

Excellent numeric accuracy ||*|| = 4.14477e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 298, 0 (0.0%) were bound flips.
      There were 9 refactorizations, 0 triggered by time and 6 by density.
       ... on average 33.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 665 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 1322.23, with a dynamic range of 13222.3.
      Time to load data was 0.015 seconds, presolve used 0.000 seconds,
       ... 0.094 seconds in simplex solver, in total 0.109 seconds.

Value of objective function: -76589.3
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.094s (0.109s total since program start)


SHARE2B.MPS:

Model name:  'SHARE2B' - run #1    
Objective:   Minimize(000000)
 
SUBMITTED
Model size:       96 constraints,      79 variables,          694 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           100 iter.
 
Optimal solution      -415.732240741 after        133 iter.

Excellent numeric accuracy ||*|| = 1.77636e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 133, 0 (0.0%) were bound flips.
      There were 5 refactorizations, 0 triggered by time and 3 by density.
       ... on average 26.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 475 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 103, with a dynamic range of 10300.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.031 seconds in simplex solver, in total 0.047 seconds.

Value of objective function: -415.732
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.031s (0.046s total since program start)


SHELL.MPS:

Model name:  'SHELL' - run #1    
Objective:   Minimize(3537)
 
SUBMITTED
Model size:      536 constraints,    1775 variables,         3556 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution          1208825346 after        633 iter.

Excellent numeric accuracy ||*|| = 3.29692e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 633, 37 (5.8%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 198.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1270 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1, with a dynamic range of 1.
      Time to load data was 0.047 seconds, presolve used 0.015 seconds,
       ... 0.719 seconds in simplex solver, in total 0.781 seconds.

Value of objective function: 1.20883e+009
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.735s (0.781s total since program start)


SHIP04L.MPS:

Model name:  'SHIP04L' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:      402 constraints,    2118 variables,         6332 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1793324.53797 after        550 iter.

Excellent numeric accuracy ||*|| = 1.0339e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 550, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 183.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1231 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 4.706, with a dynamic range of 338.866.
      Time to load data was 0.062 seconds, presolve used 0.032 seconds,
       ... 0.718 seconds in simplex solver, in total 0.812 seconds.

Value of objective function: 1.79332e+006
CPU Time for Parsing input: 0.062s (0.062s total since program start)
CPU Time for solving: 0.75s (0.812s total since program start)


SHIP04S.MPS:

Model name:  'SHIP04S' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:      402 constraints,    1458 variables,         4352 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1798714.70045 after        497 iter.

Excellent numeric accuracy ||*|| = 2.26485e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 497, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 3 by density.
       ... on average 165.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1163 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 4.706, with a dynamic range of 338.866.
      Time to load data was 0.078 seconds, presolve used 0.015 seconds,
       ... 0.516 seconds in simplex solver, in total 0.609 seconds.

Value of objective function: 1.79871e+006
CPU Time for Parsing input: 0.093s (0.093s total since program start)
CPU Time for solving: 0.532s (0.625s total since program start)


SHIP08L.MPS:

Model name:  'SHIP08L' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:      778 constraints,    4283 variables,        12802 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1909055.21139 after        898 iter.

Excellent numeric accuracy ||*|| = 3.68316e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 898, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 2 by density.
       ... on average 224.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2208 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 5, with a dynamic range of 446.01.
      Time to load data was 0.109 seconds, presolve used 0.047 seconds,
       ... 2.375 seconds in simplex solver, in total 2.531 seconds.

Value of objective function: 1.90906e+006
CPU Time for Parsing input: 0.109s (0.109s total since program start)
CPU Time for solving: 2.422s (2.531s total since program start)


SHIP08S.MPS:

Model name:  'SHIP08S' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:      778 constraints,    2387 variables,         7114 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1920098.21053 after        723 iter.

Excellent numeric accuracy ||*|| = 2.0095e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 723, 0 (0.0%) were bound flips.
      There were 3 refactorizations, 0 triggered by time and 2 by density.
       ... on average 241.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2188 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 5, with a dynamic range of 446.01.
      Time to load data was 0.062 seconds, presolve used 0.032 seconds,
       ... 1.265 seconds in simplex solver, in total 1.359 seconds.

Value of objective function: 1.9201e+006
CPU Time for Parsing input: 0.062s (0.062s total since program start)
CPU Time for solving: 1.297s (1.359s total since program start)


SHIP12L.MPS:

Model name:  'SHIP12L' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:     1151 constraints,    5427 variables,        16170 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1470187.91933 after       1472 iter.

Excellent numeric accuracy ||*|| = 6.86118e-014

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1472, 0 (0.0%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 1 by density.
       ... on average 245.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3478 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1.6, with a dynamic range of 256.
      Time to load data was 0.125 seconds, presolve used 0.063 seconds,
       ... 5.156 seconds in simplex solver, in total 5.344 seconds.

Value of objective function: 1.47019e+006
CPU Time for Parsing input: 0.14s (0.14s total since program start)
CPU Time for solving: 5.219s (5.359s total since program start)


SHIP12S.MPS:

Model name:  'SHIP12S' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:     1151 constraints,    2763 variables,         8178 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1489236.13441 after       1193 iter.

Excellent numeric accuracy ||*|| = 1.47049e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1193, 0 (0.0%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 1 by density.
       ... on average 298.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3204 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 1.6, with a dynamic range of 256.
      Time to load data was 0.078 seconds, presolve used 0.031 seconds,
       ... 2.656 seconds in simplex solver, in total 2.765 seconds.

Value of objective function: 1.48924e+006
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 2.687s (2.765s total since program start)


SIERRA.MPS:

Model name:  'SIERRA' - run #1    
Objective:   Minimize(OBJ)
 
SUBMITTED
Model size:     1227 constraints,    2036 variables,         7302 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       15394362.1836 after        691 iter.

Excellent numeric accuracy ||*|| = 6.82121e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 691, 118 (17.1%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 0 by density.
       ... on average 286.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 2624 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 100000, with a dynamic range of 100000.
      Time to load data was 0.078 seconds, presolve used 0.016 seconds,
       ... 1.094 seconds in simplex solver, in total 1.188 seconds.

Value of objective function: 1.53944e+007
CPU Time for Parsing input: 0.078s (0.078s total since program start)
CPU Time for solving: 1.109s (1.187s total since program start)


STAIR.MPS:

Model name:  'STAIR' - run #1    
Objective:   Minimize(MXR)
 
SUBMITTED
Model size:      356 constraints,     467 variables,         3856 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           265 iter.
 
Optimal solution      -251.266951193 after        476 iter.

Excellent numeric accuracy ||*|| = 2.16271e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 476, 9 (1.9%) were bound flips.
      There were 11 refactorizations, 0 triggered by time and 8 by density.
       ... on average 42.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6228 NZ entries, 1.7x largest basis.
      The constraint matrix inf-norm is 9.85263, with a dynamic range of 985263.
      Time to load data was 0.047 seconds, presolve used 0.000 seconds,
       ... 0.468 seconds in simplex solver, in total 0.515 seconds.

Value of objective function: -251.267
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.469s (0.515s total since program start)


STANDATA.MPS:

Model name:  'STANDATA' - run #1    
Objective:   Minimize(FAT...J.)
 
SUBMITTED
Model size:      359 constraints,    1075 variables,         3031 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution           1257.6995 after         86 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 86, 0 (0.0%) were bound flips.
      There were 0 refactorizations, 0 triggered by time and 0 by density.
       ... on average 86.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 360 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 300, with a dynamic range of 300.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.062 seconds in simplex solver, in total 0.109 seconds.

Value of objective function: 1257.7
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.079s (0.125s total since program start)


STANDGUB.MPS:

Model name:  'STANDGUB' - run #1    
Objective:   Minimize(FAT...J.)
 
SUBMITTED
Model size:      361 constraints,    1184 variables,         3139 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution           1257.6995 after         86 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 86, 0 (0.0%) were bound flips.
      There were 0 refactorizations, 0 triggered by time and 0 by density.
       ... on average 86.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 362 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 300, with a dynamic range of 1363.64.
      Time to load data was 0.016 seconds, presolve used 0.015 seconds,
       ... 0.063 seconds in simplex solver, in total 0.094 seconds.

Value of objective function: 1257.7
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.078s (0.109s total since program start)


STANDMPS.MPS:

Model name:  'STANDATA' - run #1    
Objective:   Minimize(FAT...J.)
 
SUBMITTED
Model size:      467 constraints,    1075 variables,         3679 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution           1406.0175 after        495 iter.

Excellent numeric accuracy ||*|| = 3.27516e-015

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 495, 2 (0.4%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 4 by density.
       ... on average 123.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1203 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 300, with a dynamic range of 300.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.453 seconds in simplex solver, in total 0.500 seconds.

Value of objective function: 1406.02
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.469s (0.5s total since program start)


STOCFOR1.MPS:

Model name:  'STOCHFOR' - run #1    
Objective:   Minimize(HARV)
 
SUBMITTED
Model size:      117 constraints,     111 variables,          447 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after            86 iter.
 
Optimal solution      -41131.9762194 after        117 iter.

Excellent numeric accuracy ||*|| = 4.44089e-016

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 117, 0 (0.0%) were bound flips.
      There were 6 refactorizations, 0 triggered by time and 4 by density.
       ... on average 19.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 375 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 336.6, with a dynamic range of 5378.72.
      Time to load data was 0.031 seconds, presolve used 0.000 seconds,
       ... 0.031 seconds in simplex solver, in total 0.062 seconds.

Value of objective function: -41132
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 0.031s (0.062s total since program start)


STOCFOR2.MPS:

Model name:  'STOCHFOR' - run #1    
Objective:   Minimize(HARV)
 
SUBMITTED
Model size:     2157 constraints,    2031 variables,         8343 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1442 iter.
 
Optimal solution      -39024.4085379 after       2042 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2042, 0 (0.0%) were bound flips.
      There were 10 refactorizations, 0 triggered by time and 2 by density.
       ... on average 204.2 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6969 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 336.6, with a dynamic range of 1660.75.
      Time to load data was 0.125 seconds, presolve used 0.031 seconds,
       ... 5.812 seconds in simplex solver, in total 5.968 seconds.

Value of objective function: -39024.4
CPU Time for Parsing input: 0.14s (0.14s total since program start)
CPU Time for solving: 5.844s (5.984s total since program start)


TUFF.MPS:

Model name:  'TUFF' - run #1    
Objective:   Minimize(B...ML..)
 
SUBMITTED
Model size:      333 constraints,     587 variables,         4520 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution      0.292147765094 after        370 iter.

Reasonable numeric accuracy ||*|| = 1.56751e-009 (rel. error 2.3068e-011)

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 370, 33 (8.9%) were bound flips.
      There were 4 refactorizations, 0 triggered by time and 4 by density.
       ... on average 84.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 1409 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 10000, with a dynamic range of 1e+009.
      Time to load data was 0.031 seconds, presolve used 0.016 seconds,
       ... 0.218 seconds in simplex solver, in total 0.265 seconds.

Value of objective function: 0.292148
CPU Time for Parsing input: 0.046s (0.046s total since program start)
CPU Time for solving: 0.235s (0.281s total since program start)


VTPBASE.MPS:

Model name:  'VTP.BASE' - run #1    
Objective:   Minimize(FAT...J.)
 
SUBMITTED
Model size:      198 constraints,     203 variables,          908 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after           187 iter.
 
Optimal solution       129831.462461 after        187 iter.

Excellent numeric accuracy ||*|| = 9.09495e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 187, 60 (32.1%) were bound flips.
      There were 5 refactorizations, 0 triggered by time and 3 by density.
       ... on average 25.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 537 NZ entries, 1.0x largest basis.
      The constraint matrix inf-norm is 4000, with a dynamic range of 30000.8.
      Time to load data was 0.016 seconds, presolve used 0.000 seconds,
       ... 0.047 seconds in simplex solver, in total 0.063 seconds.

Value of objective function: 129831
CPU Time for Parsing input: 0.015s (0.015s total since program start)
CPU Time for solving: 0.047s (0.062s total since program start)


WOOD1P.MPS:

Model name:  'WOOD1P' - run #1    
Objective:   Minimize(COST)
 
SUBMITTED
Model size:      244 constraints,    2594 variables,        70215 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1.44290241157 after        390 iter.

Excellent numeric accuracy ||*|| = 1.21885e-010

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 390, 0 (0.0%) were bound flips.
      There were 9 refactorizations, 0 triggered by time and 9 by density.
       ... on average 43.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 7225 NZ entries, 1.3x largest basis.
      The constraint matrix inf-norm is 1000, with a dynamic range of 3.33333e+007.
      Time to load data was 0.453 seconds, presolve used 0.172 seconds,
       ... 1.312 seconds in simplex solver, in total 1.937 seconds.

Value of objective function: 1.4429
CPU Time for Parsing input: 0.453s (0.453s total since program start)
CPU Time for solving: 1.484s (1.937s total since program start)


WOODW.MPS:

Model name:  'WOODW' - run #1    
Objective:   Minimize(TRCOST)
 
SUBMITTED
Model size:     1098 constraints,    8405 variables,        37474 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
 
Optimal solution       1.30447633308 after       2832 iter.

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2832, 0 (0.0%) were bound flips.
      There were 26 refactorizations, 0 triggered by time and 26 by density.
       ... on average 108.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 7740 NZ entries, 1.3x largest basis.
      The constraint matrix inf-norm is 1000, with a dynamic range of 100000.
      Time to load data was 0.218 seconds, presolve used 0.110 seconds,
       ... 17.531 seconds in simplex solver, in total 17.859 seconds.

Value of objective function: 1.30448
CPU Time for Parsing input: 0.218s (0.218s total since program start)
CPU Time for solving: 17.641s (17.859s total since program start)


SCFXM2.MPS:

Model name:  'SCFXM2' - run #1    
Objective:   Minimize(.COSTA)
 
SUBMITTED
Model size:      660 constraints,     914 variables,         5183 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1165 iter.
 
Optimal solution        36660.261565 after       1338 iter.

Excellent numeric accuracy ||*|| = 4.54747e-013

 MEMO: lp_solve version 5.5.0.11 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 1338, 0 (0.0%) were bound flips.
      There were 14 refactorizations, 0 triggered by time and 11 by density.
       ... on average 95.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 3004 NZ entries, 1.1x largest basis.
      The constraint matrix inf-norm is 130, with a dynamic range of 260000.
      Time to load data was 0.031 seconds, presolve used 0.015 seconds,
       ... 1.563 seconds in simplex solver, in total 1.609 seconds.

Value of objective function: 36660.3
CPU Time for Parsing input: 0.031s (0.031s total since program start)
CPU Time for solving: 1.578s (1.609s total since program start)
