Welcome to the CBC MILP Solver
Version: 2.9.6
Build Date: May 27 2016
command line - /usr/local/bin/cbc -mipgap 0.01 -printingOptions all -import /var/folders/wk/lcf0vgd90bx0vq1873tn04knk_djr3/T/tmpQouRDK.pyomo.lp -import -stat=1 -solve -solu /var/folders/wk/lcf0vgd90bx0vq1873tn04knk_djr3/T/tmpQouRDK.pyomo.soln (default strategy 1)
No match for mipgap - ? for list of commands
No match for 0.01 - ? for list of commands
Option for printingOptions changed from normal to all
Current default (if $ as parameter) for import is /var/folders/wk/lcf0vgd90bx0vq1873tn04knk_djr3/T/tmpQouRDK.pyomo.lp
Presolve 262 (-637) rows, 336 (-417) columns and 855 (-1409) elements
Statistics for presolved model
Original problem has 48 integers (48 of which binary)
Presolved problem has 24 integers (24 of which binary)
==== 120 zero objective 4 different
120 variables have objective of 0
48 variables have objective of 1
24 variables have objective of 2000
144 variables have objective of 1e+06
==== absolute objective values 4 different
120 variables have objective of 0
48 variables have objective of 1
24 variables have objective of 2000
144 variables have objective of 1e+06
==== for integers 0 zero objective 1 different
24 variables have objective of 2000
==== for integers absolute objective values 1 different
24 variables have objective of 2000
===== end objective counts
Problem has 262 rows, 336 columns (216 with objective) and 855 elements
There are 192 singletons with objective
Column breakdown:
240 of type 0.0->inf, 48 of type 0.0->up, 0 of type lo->inf,
24 of type lo->up, 0 of type free, 0 of type fixed,
0 of type -inf->0.0, 0 of type -inf->up, 24 of type 0.0->1.0
Row breakdown:
24 of type E 0.0, 0 of type E 1.0, 0 of type E -1.0,
48 of type E other, 0 of type G 0.0, 0 of type G 1.0,
0 of type G other, 72 of type L 0.0, 0 of type L 1.0,
118 of type L other, 0 of type Range 0.0->1.0, 0 of type Range other,
0 of type Free
Continuous objective value is 44300 - 0.00 seconds
Cgl0003I 0 fixed, 0 tightened bounds, 47 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0004I processed model has 238 rows, 335 columns (24 integer (24 of which binary)) and 805 elements
Cbc0038I Initial state - 1 integers unsatisfied sum - 0.2
Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 1.5005e+08 iterations 12
Cbc0038I Solution found of 1.5005e+08
Cbc0038I Relaxing continuous gives 1.5005e+08
Cbc0038I Before mini branch and bound, 23 integers at bound fixed and 215 continuous
Cbc0038I Full problem 238 rows 335 columns, reduced to 8 rows 9 columns
Cbc0038I Mini branch and bound improved solution from 1.5005e+08 to 1.5005e+08 (0.03 seconds)
Cbc0038I Round again with cutoff of 1.3505e+08
Cbc0038I Pass 2: suminf. 0.02000 (1) obj. 1.3505e+08 iterations 1
Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 1.3505e+08 iterations 4
Cbc0038I Solution found of 1.3505e+08
Cbc0038I Relaxing continuous gives 53700
Cbc0038I Before mini branch and bound, 23 integers at bound fixed and 213 continuous
Cbc0038I Mini branch and bound did not improve solution (0.04 seconds)
Cbc0038I Round again with cutoff of 53340
Cbc0038I Reduced cost fixing fixed 13 variables on major pass 3
Cbc0038I Pass 4: suminf. 0.20000 (1) obj. 53340 iterations 0
Cbc0038I Pass 5: suminf. 0.09474 (1) obj. 53340 iterations 10
Cbc0038I Pass 6: suminf. 1.48000 (4) obj. 53340 iterations 10
Cbc0038I Pass 7: suminf. 0.60000 (2) obj. 53340 iterations 13
Cbc0038I Pass 8: suminf. 0.14222 (2) obj. 53340 iterations 12
Cbc0038I Pass 9: suminf. 0.14222 (2) obj. 53340 iterations 4
Cbc0038I Pass 10: suminf. 0.14222 (2) obj. 53340 iterations 1
Cbc0038I Pass 11: suminf. 0.85060 (5) obj. 53340 iterations 9
Cbc0038I Pass 12: suminf. 0.85060 (5) obj. 53340 iterations 0
Cbc0038I Pass 13: suminf. 0.14222 (2) obj. 53340 iterations 8
Cbc0038I Pass 14: suminf. 0.09474 (1) obj. 53340 iterations 3
Cbc0038I Pass 15: suminf. 0.20000 (1) obj. 53340 iterations 16
Cbc0038I Pass 16: suminf. 1.48000 (4) obj. 53340 iterations 16
Cbc0038I Pass 17: suminf. 0.60000 (2) obj. 53340 iterations 12
Cbc0038I Pass 18: suminf. 0.14222 (2) obj. 53340 iterations 11
Cbc0038I Pass 19: suminf. 0.48000 (2) obj. 53340 iterations 2
Cbc0038I Pass 20: suminf. 0.57000 (3) obj. 53340 iterations 9
Cbc0038I Pass 21: suminf. 0.14222 (2) obj. 53340 iterations 12
Cbc0038I Pass 22: suminf. 0.09474 (1) obj. 53340 iterations 6
Cbc0038I Pass 23: suminf. 0.20000 (1) obj. 53340 iterations 17
Cbc0038I Pass 24: suminf. 0.84013 (6) obj. 53340 iterations 12
Cbc0038I Pass 25: suminf. 0.48000 (2) obj. 53340 iterations 8
Cbc0038I Pass 26: suminf. 0.48000 (2) obj. 53340 iterations 2
Cbc0038I Pass 27: suminf. 1.21810 (6) obj. 53340 iterations 3
Cbc0038I Pass 28: suminf. 0.47100 (5) obj. 53340 iterations 6
Cbc0038I Pass 29: suminf. 0.67610 (5) obj. 53340 iterations 3
Cbc0038I Pass 30: suminf. 0.47100 (5) obj. 53340 iterations 2
Cbc0038I Pass 31: suminf. 0.67610 (5) obj. 53340 iterations 1
Cbc0038I Pass 32: suminf. 1.31990 (7) obj. 53340 iterations 4
Cbc0038I Pass 33: suminf. 1.19999 (6) obj. 53340 iterations 5
Cbc0038I No solution found this major pass
Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 199 continuous
Cbc0038I Full problem 238 rows 335 columns, reduced to 53 rows 40 columns
Cbc0038I Mini branch and bound improved solution from 53700 to 53700 (0.06 seconds)
Cbc0038I Round again with cutoff of 52908
Cbc0038I Reduced cost fixing fixed 13 variables on major pass 4
Cbc0038I Pass 33: suminf. 0.20000 (1) obj. 52908 iterations 0
Cbc0038I Pass 34: suminf. 0.29600 (1) obj. 52908 iterations 10
Cbc0038I Pass 35: suminf. 0.29600 (1) obj. 52908 iterations 0
Cbc0038I Pass 36: suminf. 0.29600 (1) obj. 52908 iterations 2
Cbc0038I Pass 37: suminf. 0.29600 (1) obj. 52908 iterations 3
Cbc0038I Pass 38: suminf. 0.69600 (2) obj. 52908 iterations 2
Cbc0038I Pass 39: suminf. 0.69600 (2) obj. 52908 iterations 0
Cbc0038I Pass 40: suminf. 0.48190 (5) obj. 52908 iterations 2
Cbc0038I Pass 41: suminf. 0.29600 (1) obj. 52908 iterations 9
Cbc0038I Pass 42: suminf. 1.26794 (6) obj. 52908 iterations 9
Cbc0038I Pass 43: suminf. 0.93980 (5) obj. 52908 iterations 2
Cbc0038I Pass 44: suminf. 1.18938 (5) obj. 52908 iterations 5
Cbc0038I Pass 45: suminf. 0.48190 (5) obj. 52908 iterations 4
Cbc0038I Pass 46: suminf. 1.00210 (6) obj. 52908 iterations 2
Cbc0038I Pass 47: suminf. 0.48190 (5) obj. 52908 iterations 2
Cbc0038I Pass 48: suminf. 1.20000 (6) obj. 52908 iterations 6
Cbc0038I Pass 49: suminf. 0.69600 (2) obj. 52908 iterations 8
Cbc0038I Pass 50: suminf. 0.69600 (2) obj. 52908 iterations 3
Cbc0038I Pass 51: suminf. 0.29600 (1) obj. 52908 iterations 1
Cbc0038I Pass 52: suminf. 0.20000 (1) obj. 52908 iterations 9
Cbc0038I Pass 53: suminf. 0.88358 (7) obj. 52908 iterations 9
Cbc0038I Pass 54: suminf. 0.88358 (7) obj. 52908 iterations 0
Cbc0038I Pass 55: suminf. 0.88358 (7) obj. 52908 iterations 0
Cbc0038I Pass 56: suminf. 1.25576 (8) obj. 52908 iterations 2
Cbc0038I Pass 57: suminf. 0.88358 (7) obj. 52908 iterations 2
Cbc0038I Pass 58: suminf. 0.69600 (2) obj. 52908 iterations 10
Cbc0038I Pass 59: suminf. 0.69600 (2) obj. 52908 iterations 2
Cbc0038I Pass 60: suminf. 0.29600 (1) obj. 52908 iterations 1
Cbc0038I Pass 61: suminf. 0.20000 (1) obj. 52908 iterations 14
Cbc0038I Pass 62: suminf. 1.23860 (7) obj. 52908 iterations 14
Cbc0038I No solution found this major pass
Cbc0038I Before mini branch and bound, 13 integers at bound fixed and 203 continuous
Cbc0038I Mini branch and bound did not improve solution (0.07 seconds)
Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 53700 - took 0.04 seconds
Cbc0012I Integer solution of 53700 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds)
Cbc0038I Full problem 238 rows 335 columns, reduced to 136 rows 246 columns - 1 fixed gives 135, 245 - still too large
Cbc0038I Full problem 238 rows 335 columns, reduced to 132 rows 245 columns - too large
Cbc0006I The LP relaxation is infeasible or too expensive
Cbc0013I At root node, 0 cuts changed objective from 51900 to 53700 in 1 passes
Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0001I Search completed - best objective 53700, took 3 iterations and 0 nodes (0.08 seconds)
Cbc0035I Maximum depth 0, 12 variables fixed on reduced cost
Cuts at root node changed objective from 51900 to 53700
Probing was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Optimal solution found
Objective value: 53700.00000000
Enumerated nodes: 0
Total iterations: 3
Time (CPU seconds): 0.09
Time (Wallclock seconds): 0.09
Total time (CPU seconds): 0.10 (Wallclock seconds): 0.11