
Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:        5 constraints,       1 variables,            5 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             1 iter.
 
Optimal solution             0.27803 after          2 iter.

Relative numeric accuracy ||*|| = 4.34349e-017

 MEMO: lp_solve version 5.5.2.5 for 64 bit OS, with 64 bit REAL variables.
      In the total iteration count 2, 0 (0.0%) were bound flips.
      There were 2 refactorizations, 0 triggered by time and 0 by density.
       ... on average 1.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 11 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.000 seconds, presolve used 0.000 seconds,
       ... 0.001 seconds in simplex solver, in total 0.001 seconds.
