[Couenne] How does the option art_cutff really work?
Suyun Liu
sul217 at lehigh.edu
Tue Mar 27 19:47:33 EDT 2018
Hi all,
I am using Couenne to solve a MINLP model. Before I set the artificial
cutoff, the output log file is as follow:
ANALYSIS TEST: NLP0012I
Num Status Obj It time
Location
NLP0014I 1 OPT -1.9980011e-07 207 1.284
*Couenne: new cutoff value 0.0000000000e+00 (1.344 seconds)*
Loaded instance "/tmp/tmpfway44.pyomo.nl"
Constraints: 340
Variables: 251 (80 integer)
Auxiliaries: 181 (1 integer)
Coin0506I Presolve 386 (-81) rows, 211 (-221) columns and 1343 (-249)
elements
Clp0006I 0 Obj 0 Primal inf 5492.8755 (104)
Clp0006I 82 Obj 8.5520883e-16 Primal inf 1685.5012 (94)
Clp0006I 147 Obj 8.0836286e-16 Primal inf 763.81651 (82)
Clp0006I 200 Obj 1.2095835e-15 Primal inf 65.049667 (25)
Clp0006I 218 Obj 8.849406e-16
Clp0000I Optimal - objective value 0
Clp0032I Optimal objective 0 - 218 iterations time 0.012, Presolve 0.00
Clp0000I Optimal - objective value 0
Cbc0012I Integer solution of 0 found by Couenne Rounding NLP after 0
iterations and 0 nodes (0.00 seconds)
NLP Heuristic: time limit reached.
Clp0006I 0 Obj 5741236.1 Dual inf 397.13524 (85)
Clp0006I 0 Obj 5741236.1 Dual inf 397.13524 (85)
Clp0006I 43 Obj 5740630.1 Dual inf 1021.1571 (76)
Clp0006I 89 Obj 5740105.7 Dual inf 85.705639 (60)
Clp0006I 134 Obj 5739789.8 Dual inf 11.116202 (30)
Clp0006I 176 Obj 5739764.1
Clp0000I Optimal - objective value 5739764.1
*Cbc0001I Search completed - best objective 0, took 176 iterations and 0
nodes (0.02 seconds)*
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Clp0006I 0 Obj 0 Primal inf 198.78648 (63)
Clp0006I 36 Obj 3.3917289e-16 Primal inf 637.71469 (85)
Clp0006I 92 Obj -7.8568705e-16 Primal inf 895.90803 (77)
Clp0006I 150 Obj -2.5890557e-15 Primal inf 9.9742629e-05 (25)
Clp0006I 151 Obj -2.5890544e-15 Primal inf 0.00017072599 (25)
Clp0006I 152 Obj 0 Primal inf 0.0035095124 (25) Dual inf 3.4537304 (5)
Clp0006I 158 Obj 0 Primal inf 0.0035095527 (24)
Clp0001I Primal infeasible - objective value 0
Clp1001I Initial range of elements is 1e-05 to 1
Clp1003I Final range of elements is 0.14320674 to 6.9829115
Clp0022I Absolute values of scaled rhs range from 1 to 135.69747, minimum
gap 1e+100
Clp0020I Absolute values of scaled objective range from 1 to 1
Clp0021I Absolute values of scaled bounds range from 6.9971591e-13 to
14320.674, minimum gap 1.4320674
Clp0006I 0 Obj 0 Primal inf 0.0035095527 (24)
Clp0006I 0 Obj 0 Primal inf 0.0035095527 (24)
Clp0006I 0 Obj 0 Primal inf 0.0035095527 (24)
Clp0001I Primal infeasible - objective value 0
"Finished"
Linearization cuts added at root node: 467
Linearization cuts added in total: 467 (separation time: 0.004s)
Total solve time: 0.036s (0.036s in
branch-and-bound)
Lower bound: 0
Upper bound: 0 (gap: 0.00%)
Branch-and-bound nodes: 0
Stats: /tmp/tmpfway44.pyomo.nl 251 [var] 80 [int] 340 [con] 181 [aux]
467 [root] 467 [tot] 0.004 [sep] 0.036 [time] 0.036 [bb]
0.000000e+00 [lower] 0.000000e+00 [upper] 0 [nodes]
Since I have already got a local optimal (which is actually the global
minimum) via other method and hence I put the objective value 0 as the
cutoff through the art_cutoff option. The new log file is as follow:
ANALYSIS TEST: *Couenne: new cutoff value 0.0000000000e+00 (0.04 seconds)*
*CutOff set to 0.000000*
NLP0012I
Num Status Obj It time
Location
NLP0014I 1 OPT 0 104 1.296
Loaded instance "/tmp/tmpZ1I5T7.pyomo.nl"
Constraints: 340
Variables: 251 (80 integer)
Auxiliaries: 181 (1 integer)
Coin0506I Presolve 386 (-81) rows, 211 (-221) columns and 1343 (-249)
elements
Clp0006I 0 Obj 0 Primal inf 5492.8755 (104)
Clp0006I 82 Obj 8.5520883e-16 Primal inf 1685.5012 (94)
Clp0006I 147 Obj 8.0836286e-16 Primal inf 763.81651 (82)
Clp0006I 200 Obj 1.2095835e-15 Primal inf 65.049667 (25)
Clp0006I 218 Obj 8.849406e-16
Clp0000I Optimal - objective value 0
Clp0032I Optimal objective 0 - 218 iterations time 0.012, Presolve 0.00
Clp0000I Optimal - objective value 0
NLP Heuristic: time limit reached.
Clp0006I 0 Obj 5741236.1 Dual inf 397.13524 (85)
Clp0006I 0 Obj 5741236.1 Dual inf 397.13524 (85)
Clp0006I 43 Obj 5740630.1 Dual inf 1021.1571 (76)
Clp0006I 89 Obj 5740105.7 Dual inf 85.705639 (60)
Clp0006I 134 Obj 5739789.8 Dual inf 11.116202 (30)
Clp0006I 176 Obj 5739764.1
Clp0000I Optimal - objective value 5739764.1
Optimality Based BT: 0 improved bounds
Probing: 0 improved bounds
*NLP Heuristic: time limit reached.*
Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes
Cbc0014I Cut generator 0 (Couenne convexifier cuts) - 0 row cuts average
0.0 elements, 0 column cuts (0 active)
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible
-1.7976931e+308 (0.88 seconds)
Optimality Based BT: 0 improved bounds
Optimality Based BT: 0 improved bounds
Optimality Based BT: 0 improved bounds
Optimality Based BT: 0 improved bounds
Optimality Based BT: 0 improved bounds
Optimality Based BT: 1 improved bounds
Cbc0010I After 100 nodes, 49 on tree, 1e+50 best solution, best possible 0
(12.16 seconds)
Cbc0010I After 200 nodes, 80 on tree, 1e+50 best solution, best possible 0
(12.95 seconds)
Optimality Based BT: 0 improved bounds
Optimality Based BT: 1 improved bounds
Optimality Based BT: 0 improved bounds
Cbc0010I After 300 nodes, 112 on tree, 1e+50 best solution, best possible 0
(20.70 seconds)
Cbc0010I After 400 nodes, 155 on tree, 1e+50 best solution, best possible 0
(21.35 seconds)
Cbc0010I After 500 nodes, 180 on tree, 1e+50 best solution, best possible 0
(21.90 seconds)
Optimality Based BT: 1 improved bounds
Optimality Based BT: 0 improved bounds
Cbc0010I After 600 nodes, 214 on tree, 1e+50 best solution, best possible 0
(27.98 seconds)
Cbc0010I After 700 nodes, 259 on tree, 1e+50 best solution, best possible 0
(28.64 seconds)
Cbc0010I After 800 nodes, 288 on tree, 1e+50 best solution, best possible 0
(29.20 seconds)
Optimality Based BT: 1 improved bounds
Cbc0010I After 900 nodes, 314 on tree, 1e+50 best solution, best possible 0
(30.21 seconds)
Cbc0010I After 1000 nodes, 362 on tree, 1e+50 best solution, best possible
0 (30.82 seconds)
Cbc0010I After 1100 nodes, 388 on tree, 1e+50 best solution, best possible
0 (31.41 seconds)
Cbc0010I After 1200 nodes, 421 on tree, 1e+50 best solution, best possible
0 (32.47 seconds)
Cbc0010I After 1300 nodes, 458 on tree, 1e+50 best solution, best possible
0 (33.08 seconds)
Cbc0010I After 1400 nodes, 502 on tree, 1e+50 best solution, best possible
0 (34.14 seconds)
Cbc0010I After 1500 nodes, 524 on tree, 1e+50 best solution, best possible
0 (34.68 seconds)
Cbc0010I After 1600 nodes, 558 on tree, 1e+50 best solution, best possible
0 (35.24 seconds)
Cbc0010I After 1700 nodes, 596 on tree, 1e+50 best solution, best possible
0 (35.76 seconds)
Cbc0010I After 1800 nodes, 614 on tree, 1e+50 best solution, best possible
0 (36.20 seconds)
Cbc0010I After 1900 nodes, 650 on tree, 1e+50 best solution, best possible
0 (36.92 seconds)
Cbc0010I After 2000 nodes, 683 on tree, 1e+50 best solution, best possible
0 (37.42 seconds)
Cbc0010I After 2100 nodes, 703 on tree, 1e+50 best solution, best possible
0 (37.97 seconds)
Cbc0010I After 2200 nodes, 732 on tree, 1e+50 best solution, best possible
0 (38.50 seconds)
Cbc0010I After 2300 nodes, 770 on tree, 1e+50 best solution, best possible
0 (39.04 seconds)
Cbc0010I After 2400 nodes, 791 on tree, 1e+50 best solution, best possible
0 (40.32 seconds)
Cbc0010I After 2500 nodes, 834 on tree, 1e+50 best solution, best possible
0 (41.12 seconds)
Cbc0010I After 2600 nodes, 870 on tree, 1e+50 best solution, best possible
0 (41.71 seconds)
Cbc0010I After 2700 nodes, 906 on tree, 1e+50 best solution, best possible
0 (42.27 seconds)
Cbc0010I After 2800 nodes, 948 on tree, 1e+50 best solution, best possible
0 (42.91 seconds)
Cbc0010I After 2900 nodes, 970 on tree, 1e+50 best solution, best possible
0 (43.44 seconds)
Cbc0010I After 3000 nodes, 1007 on tree, 1e+50 best solution, best possible
0 (44.03 seconds)
Cbc0010I After 3100 nodes, 1037 on tree, 1e+50 best solution, best possible
0 (44.66 seconds)
Cbc0010I After 3200 nodes, 1052 on tree, 1e+50 best solution, best possible
0 (45.22 seconds)
Cbc0010I After 3300 nodes, 1095 on tree, 1e+50 best solution, best possible
0 (45.74 seconds)
Cbc0010I After 3400 nodes, 1119 on tree, 1e+50 best solution, best possible
0 (46.21 seconds)
Cbc0010I After 3500 nodes, 1142 on tree, 1e+50 best solution, best possible
0 (46.91 seconds)
Cbc0010I After 3600 nodes, 1188 on tree, 1e+50 best solution, best possible
0 (47.48 seconds)
Cbc0010I After 3700 nodes, 1212 on tree, 1e+50 best solution, best possible
0 (48.04 seconds)
Cbc0010I After 3800 nodes, 1250 on tree, 1e+50 best solution, best possible
0 (48.62 seconds)
Cbc0010I After 3900 nodes, 1287 on tree, 1e+50 best solution, best possible
0 (49.35 seconds)
Cbc0010I After 4000 nodes, 1310 on tree, 1e+50 best solution, best possible
0 (50.00 seconds)
Cbc0010I After 4100 nodes, 1345 on tree, 1e+50 best solution, best possible
0 (50.54 seconds)
Cbc0010I After 4200 nodes, 1382 on tree, 1e+50 best solution, best possible
0 (51.16 seconds)
Cbc0010I After 4300 nodes, 1415 on tree, 1e+50 best solution, best possible
0 (51.73 seconds)
Cbc0010I After 4400 nodes, 1456 on tree, 1e+50 best solution, best possible
0 (52.40 seconds)
Cbc0010I After 4500 nodes, 1476 on tree, 1e+50 best solution, best possible
0 (52.94 seconds)
Cbc0010I After 4600 nodes, 1521 on tree, 1e+50 best solution, best possible
0 (53.58 seconds)
Cbc0010I After 4700 nodes, 1545 on tree, 1e+50 best solution, best possible
0 (54.18 seconds)
Cbc0010I After 4800 nodes, 1570 on tree, 1e+50 best solution, best possible
0 (54.73 seconds)
Cbc0010I After 4900 nodes, 1609 on tree, 1e+50 best solution, best possible
0 (55.41 seconds)
Cbc0010I After 5000 nodes, 1632 on tree, 1e+50 best solution, best possible
0 (55.93 seconds)
Cbc0010I After 5100 nodes, 1675 on tree, 1e+50 best solution, best possible
0 (56.58 seconds)
Cbc0010I After 5200 nodes, 1697 on tree, 1e+50 best solution, best possible
0 (57.18 seconds)
Cbc0010I After 5300 nodes, 1742 on tree, 1e+50 best solution, best possible
0 (57.82 seconds)
Cbc0010I After 5400 nodes, 1772 on tree, 1e+50 best solution, best possible
0 (58.50 seconds)
Cbc0010I After 5500 nodes, 1805 on tree, 1e+50 best solution, best possible
0 (59.12 seconds)
Cbc0010I After 5600 nodes, 1823 on tree, 1e+50 best solution, best possible
0 (59.68 seconds)
Cbc0010I After 5700 nodes, 1864 on tree, 1e+50 best solution, best possible
0 (60.28 seconds)
Cbc0010I After 5800 nodes, 1894 on tree, 1e+50 best solution, best possible
0 (60.90 seconds)
Cbc0010I After 5900 nodes, 1920 on tree, 1e+50 best solution, best possible
0 (61.46 seconds)
Cbc0010I After 6000 nodes, 1951 on tree, 1e+50 best solution, best possible
0 (62.11 seconds)
Cbc0010I After 6100 nodes, 1970 on tree, 1e+50 best solution, best possible
0 (62.68 seconds)
Cbc0010I After 6200 nodes, 2010 on tree, 1e+50 best solution, best possible
0 (63.22 seconds)
Cbc0010I After 6300 nodes, 2037 on tree, 1e+50 best solution, best possible
0 (63.79 seconds)
Cbc0010I After 6400 nodes, 2073 on tree, 1e+50 best solution, best possible
0 (64.39 seconds)
Cbc0010I After 6500 nodes, 2100 on tree, 1e+50 best solution, best possible
0 (65.02 seconds)
Cbc0010I After 6600 nodes, 2141 on tree, 1e+50 best solution, best possible
0 (65.67 seconds)
Cbc0010I After 6700 nodes, 2177 on tree, 1e+50 best solution, best possible
0 (66.32 seconds)
Cbc0010I After 6800 nodes, 2203 on tree, 1e+50 best solution, best possible
0 (66.94 seconds)
Cbc0010I After 6900 nodes, 2229 on tree, 1e+50 best solution, best possible
0 (67.48 seconds)
Cbc0010I After 7000 nodes, 2266 on tree, 1e+50 best solution, best possible
0 (68.08 seconds)
Cbc0010I After 7100 nodes, 2282 on tree, 1e+50 best solution, best possible
0 (68.62 seconds)
Cbc0010I After 7200 nodes, 2317 on tree, 1e+50 best solution, best possible
0 (69.24 seconds)
Cbc0010I After 7300 nodes, 2346 on tree, 1e+50 best solution, best possible
0 (69.87 seconds)
Cbc0010I After 7400 nodes, 2381 on tree, 1e+50 best solution, best possible
0 (70.46 seconds)
Cbc0010I After 7500 nodes, 2406 on tree, 1e+50 best solution, best possible
0 (71.06 seconds)
Cbc0010I After 7600 nodes, 2447 on tree, 1e+50 best solution, best possible
0 (71.72 seconds)
Cbc0010I After 7700 nodes, 2467 on tree, 1e+50 best solution, best possible
0 (72.25 seconds)
Cbc0010I After 7800 nodes, 2505 on tree, 1e+50 best solution, best possible
0 (72.89 seconds)
Cbc0010I After 7900 nodes, 2541 on tree, 1e+50 best solution, best possible
0 (73.48 seconds)
Cbc0010I After 8000 nodes, 2569 on tree, 1e+50 best solution, best possible
0 (74.10 seconds)
Cbc0010I After 8100 nodes, 2601 on tree, 1e+50 best solution, best possible
0 (74.70 seconds)
Cbc0010I After 8200 nodes, 2629 on tree, 1e+50 best solution, best possible
0 (75.25 seconds)
Cbc0010I After 8300 nodes, 2668 on tree, 1e+50 best solution, best possible
0 (75.92 seconds)
Cbc0010I After 8400 nodes, 2698 on tree, 1e+50 best solution, best possible
0 (76.45 seconds)
Cbc0010I After 8500 nodes, 2736 on tree, 1e+50 best solution, best possible
0 (77.06 seconds)
Cbc0010I After 8600 nodes, 2762 on tree, 1e+50 best solution, best possible
0 (77.76 seconds)
Cbc0010I After 8700 nodes, 2801 on tree, 1e+50 best solution, best possible
0 (78.46 seconds)
Cbc0010I After 8800 nodes, 2825 on tree, 1e+50 best solution, best possible
0 (79.02 seconds)
Cbc0010I After 8900 nodes, 2860 on tree, 1e+50 best solution, best possible
0 (79.74 seconds)
Cbc0010I After 9000 nodes, 2890 on tree, 1e+50 best solution, best possible
0 (80.33 seconds)
Cbc0010I After 9100 nodes, 2915 on tree, 1e+50 best solution, best possible
0 (80.94 seconds)
Cbc0010I After 9200 nodes, 2943 on tree, 1e+50 best solution, best possible
0 (81.55 seconds)
Cbc0010I After 9300 nodes, 2976 on tree, 1e+50 best solution, best possible
0 (82.18 seconds)
Cbc0010I After 9400 nodes, 3007 on tree, 1e+50 best solution, best possible
0 (82.84 seconds)
Cbc0010I After 9500 nodes, 3041 on tree, 1e+50 best solution, best possible
0 (83.46 seconds)
Cbc0010I After 9600 nodes, 3080 on tree, 1e+50 best solution, best possible
0 (84.21 seconds)
Cbc0010I After 9700 nodes, 3107 on tree, 1e+50 best solution, best possible
0 (84.81 seconds)
Cbc0010I After 9800 nodes, 3142 on tree, 1e+50 best solution, best possible
0 (85.55 seconds)
Cbc0010I After 9900 nodes, 3172 on tree, 1e+50 best solution, best possible
0 (86.20 seconds)
Cbc0010I After 10000 nodes, 3206 on tree, 1e+50 best solution, best
possible 0 (86.90 seconds)
Cbc0010I After 10100 nodes, 3236 on tree, 1e+50 best solution, best
possible 0 (87.53 seconds)
Cbc0010I After 10200 nodes, 3263 on tree, 1e+50 best solution, best
possible 0 (88.17 seconds)
Cbc0010I After 10300 nodes, 3299 on tree, 1e+50 best solution, best
possible 0 (88.94 seconds)
Cbc0010I After 10400 nodes, 3320 on tree, 1e+50 best solution, best
possible 0 (89.55 seconds)
Cbc0010I After 10500 nodes, 3346 on tree, 1e+50 best solution, best
possible 0 (90.20 seconds)
Cbc0010I After 10600 nodes, 3380 on tree, 1e+50 best solution, best
possible 0 (90.84 seconds)
Cbc0010I After 10700 nodes, 3409 on tree, 1e+50 best solution, best
possible 0 (91.42 seconds)
Cbc0010I After 10800 nodes, 3435 on tree, 1e+50 best solution, best
possible 0 (92.02 seconds)
Cbc0010I After 10900 nodes, 3464 on tree, 1e+50 best solution, best
possible 0 (92.76 seconds)
Cbc0010I After 11000 nodes, 3500 on tree, 1e+50 best solution, best
possible 0 (93.47 seconds)
Cbc0010I After 11100 nodes, 3527 on tree, 1e+50 best solution, best
possible 0 (94.12 seconds)
Cbc0010I After 11200 nodes, 3560 on tree, 1e+50 best solution, best
possible 0 (94.86 seconds)
Cbc0010I After 11300 nodes, 3590 on tree, 1e+50 best solution, best
possible 0 (95.53 seconds)
Cbc0010I After 11400 nodes, 3622 on tree, 1e+50 best solution, best
possible 0 (96.08 seconds)
Cbc0010I After 11500 nodes, 3641 on tree, 1e+50 best solution, best
possible 0 (96.62 seconds)
Cbc0010I After 11600 nodes, 3677 on tree, 1e+50 best solution, best
possible 0 (97.32 seconds)
Cbc0010I After 11700 nodes, 3706 on tree, 1e+50 best solution, best
possible 0 (97.92 seconds)
Cbc0010I After 11800 nodes, 3743 on tree, 1e+50 best solution, best
possible 0 (98.71 seconds)
Cbc0010I After 11900 nodes, 3777 on tree, 1e+50 best solution, best
possible 0 (99.34 seconds)
Cbc0010I After 12000 nodes, 3812 on tree, 1e+50 best solution, best
possible 0 (100.10 seconds)
Cbc0010I After 12100 nodes, 3842 on tree, 1e+50 best solution, best
possible 0 (100.74 seconds)
Cbc0010I After 12200 nodes, 3878 on tree, 1e+50 best solution, best
possible 0 (101.45 seconds)
Cbc0010I After 12300 nodes, 3908 on tree, 1e+50 best solution, best
possible 0 (102.14 seconds)
Cbc0010I After 12400 nodes, 3934 on tree, 1e+50 best solution, best
possible 0 (102.70 seconds)
Cbc0010I After 12500 nodes, 3962 on tree, 1e+50 best solution, best
possible 0 (103.57 seconds)
Cbc0010I After 12600 nodes, 3998 on tree, 1e+50 best solution, best
possible 0 (104.24 seconds)
Cbc0010I After 12700 nodes, 4032 on tree, 1e+50 best solution, best
possible 0 (104.92 seconds)
Cbc0010I After 12800 nodes, 4058 on tree, 1e+50 best solution, best
possible 0 (105.61 seconds)
Cbc0010I After 12900 nodes, 4084 on tree, 1e+50 best solution, best
possible 0 (106.24 seconds)
Cbc0010I After 13000 nodes, 4120 on tree, 1e+50 best solution, best
possible 0 (106.94 seconds)
Cbc0010I After 13100 nodes, 4140 on tree, 1e+50 best solution, best
possible 0 (107.50 seconds)
Cbc0010I After 13200 nodes, 4170 on tree, 1e+50 best solution, best
possible 0 (108.17 seconds)
Cbc0010I After 13300 nodes, 4200 on tree, 1e+50 best solution, best
possible 0 (108.84 seconds)
Cbc0010I After 13400 nodes, 4222 on tree, 1e+50 best solution, best
possible 0 (109.41 seconds)
Cbc0010I After 13500 nodes, 4249 on tree, 1e+50 best solution, best
possible 0 (110.04 seconds)
Cbc0010I After 13600 nodes, 4278 on tree, 1e+50 best solution, best
possible 0 (110.66 seconds)
Cbc0010I After 13700 nodes, 4304 on tree, 1e+50 best solution, best
possible 0 (111.33 seconds)
Cbc0010I After 13800 nodes, 4337 on tree, 1e+50 best solution, best
possible 0 (111.98 seconds)
Cbc0010I After 13900 nodes, 4359 on tree, 1e+50 best solution, best
possible 0 (112.58 seconds)
Cbc0010I After 14000 nodes, 4390 on tree, 1e+50 best solution, best
possible 0 (113.21 seconds)
Cbc0010I After 14100 nodes, 4415 on tree, 1e+50 best solution, best
possible 0 (113.82 seconds)
Cbc0010I After 14200 nodes, 4438 on tree, 1e+50 best solution, best
possible 0 (114.42 seconds)
Cbc0010I After 14300 nodes, 4468 on tree, 1e+50 best solution, best
possible 0 (115.07 seconds)
Cbc0010I After 14400 nodes, 4496 on tree, 1e+50 best solution, best
possible 0 (115.68 seconds)
Cbc0010I After 14500 nodes, 4518 on tree, 1e+50 best solution, best
possible 0 (116.22 seconds)
Cbc0010I After 14600 nodes, 4541 on tree, 1e+50 best solution, best
possible 0 (116.77 seconds)
Cbc0010I After 14700 nodes, 4569 on tree, 1e+50 best solution, best
possible 0 (117.33 seconds)
Cbc0010I After 14800 nodes, 4597 on tree, 1e+50 best solution, best
possible 0 (117.93 seconds)
Cbc0010I After 14900 nodes, 4613 on tree, 1e+50 best solution, best
possible 0 (118.48 seconds)
Cbc0010I After 15000 nodes, 4638 on tree, 1e+50 best solution, best
possible 0 (119.29 seconds)
Cbc0010I After 15100 nodes, 4661 on tree, 1e+50 best solution, best
possible 0 (119.80 seconds)
Cbc0010I After 15200 nodes, 4685 on tree, 1e+50 best solution, best
possible 0 (120.36 seconds)
Cbc0010I After 15300 nodes, 4709 on tree, 1e+50 best solution, best
possible 0 (120.90 seconds)
Cbc0010I After 15400 nodes, 4733 on tree, 1e+50 best solution, best
possible 0 (121.44 seconds)
Cbc0010I After 15500 nodes, 4758 on tree, 1e+50 best solution, best
possible 0 (121.97 seconds)
Cbc0010I After 15600 nodes, 4783 on tree, 1e+50 best solution, best
possible 0 (122.50 seconds)
Cbc0010I After 15700 nodes, 4799 on tree, 1e+50 best solution, best
possible 0 (123.00 seconds)
Cbc0010I After 15800 nodes, 4826 on tree, 1e+50 best solution, best
possible 0 (123.54 seconds)
Cbc0010I After 15900 nodes, 4852 on tree, 1e+50 best solution, best
possible 0 (124.08 seconds)
Optimality Based BT: 1 improved bounds
Optimality Based BT: 0 improved bounds
Cbc0010I After 16000 nodes, 4879 on tree, 1e+50 best solution, best
possible 0 (126.41 seconds)
Cbc0010I After 16100 nodes, 4917 on tree, 1e+50 best solution, best
possible 0 (126.96 seconds)
Optimality Based BT: 1 improved bounds
Optimality Based BT: 1 improved bounds
Cbc0010I After 16200 nodes, 4950 on tree, 1e+50 best solution, best
possible 0 (128.80 seconds)
Cbc0010I After 16300 nodes, 4983 on tree, 1e+50 best solution, best
possible 0 (129.40 seconds)
Cbc0010I After 16400 nodes, 5003 on tree, 1e+50 best solution, best
possible 0 (129.96 seconds)
Optimality Based BT: 0 improved bounds
Cbc0010I After 16500 nodes, 5038 on tree, 1e+50 best solution, best
possible 0 (132.18 seconds)
Cbc0010I After 16600 nodes, 5074 on tree, 1e+50 best solution, best
possible 0 (132.78 seconds)
Cbc0010I After 16700 nodes, 5099 on tree, 1e+50 best solution, best
possible 0 (133.82 seconds)
Cbc0010I After 16800 nodes, 5136 on tree, 1e+50 best solution, best
possible 0 (134.33 seconds)
Cbc0010I After 16900 nodes, 5182 on tree, 1e+50 best solution, best
possible 0 (135.08 seconds)
Cbc0010I After 17000 nodes, 5224 on tree, 1e+50 best solution, best
possible 0 (135.83 seconds)
Cbc0010I After 17100 nodes, 5251 on tree, 1e+50 best solution, best
possible 0 (136.39 seconds)
Cbc0010I After 17200 nodes, 5268 on tree, 1e+50 best solution, best
possible 0 (136.87 seconds)
Cbc0010I After 17300 nodes, 5310 on tree, 1e+50 best solution, best
possible 0 (137.41 seconds)
Cbc0010I After 17400 nodes, 5331 on tree, 1e+50 best solution, best
possible 0 (137.93 seconds)
Cbc0010I After 17500 nodes, 5375 on tree, 1e+50 best solution, best
possible 0 (138.60 seconds)
Cbc0010I After 17600 nodes, 5401 on tree, 1e+50 best solution, best
possible 0 (139.19 seconds)
Cbc0010I After 17700 nodes, 5431 on tree, 1e+50 best solution, best
possible 0 (139.73 seconds)
Cbc0010I After 17800 nodes, 5470 on tree, 1e+50 best solution, best
possible 0 (140.33 seconds)
Cbc0010I After 17900 nodes, 5506 on tree, 1e+50 best solution, best
possible 0 (140.88 seconds)
Cbc0010I After 18000 nodes, 5537 on tree, 1e+50 best solution, best
possible 0 (141.44 seconds)
Cbc0010I After 18100 nodes, 5582 on tree, 1e+50 best solution, best
possible 0 (142.03 seconds)
Cbc0010I After 18200 nodes, 5610 on tree, 1e+50 best solution, best
possible 0 (142.62 seconds)
Cbc0010I After 18300 nodes, 5636 on tree, 1e+50 best solution, best
possible 0 (143.18 seconds)
Cbc0010I After 18400 nodes, 5673 on tree, 1e+50 best solution, best
possible 0 (144.00 seconds)
Cbc0010I After 18500 nodes, 5695 on tree, 1e+50 best solution, best
possible 0 (144.71 seconds)
Cbc0010I After 18600 nodes, 5720 on tree, 1e+50 best solution, best
possible 0 (145.24 seconds)
Cbc0010I After 18700 nodes, 5751 on tree, 1e+50 best solution, best
possible 0 (145.86 seconds)
Cbc0010I After 18800 nodes, 5770 on tree, 1e+50 best solution, best
possible 0 (146.30 seconds)
Cbc0010I After 18900 nodes, 5802 on tree, 1e+50 best solution, best
possible 0 (146.88 seconds)
Cbc0010I After 19000 nodes, 5826 on tree, 1e+50 best solution, best
possible 0 (147.54 seconds)
Cbc0010I After 19100 nodes, 5855 on tree, 1e+50 best solution, best
possible 0 (148.07 seconds)
Cbc0010I After 19200 nodes, 5888 on tree, 1e+50 best solution, best
possible 0 (148.64 seconds)
Cbc0010I After 19300 nodes, 5923 on tree, 1e+50 best solution, best
possible 0 (149.10 seconds)
Cbc0010I After 19400 nodes, 5953 on tree, 1e+50 best solution, best
possible 0 (149.67 seconds)
Cbc0010I After 19500 nodes, 5992 on tree, 1e+50 best solution, best
possible 0 (150.29 seconds)
Cbc0010I After 19600 nodes, 6025 on tree, 1e+50 best solution, best
possible 0 (150.84 seconds)
Cbc0010I After 19700 nodes, 6046 on tree, 1e+50 best solution, best
possible 0 (151.33 seconds)
Cbc0010I After 19800 nodes, 6089 on tree, 1e+50 best solution, best
possible 0 (151.96 seconds)
Cbc0010I After 19900 nodes, 6108 on tree, 1e+50 best solution, best
possible 0 (152.53 seconds)
Cbc0010I After 20000 nodes, 6126 on tree, 1e+50 best solution, best
possible 0 (153.05 seconds)
Cbc0004I Integer solution of 0 found after 579240 iterations and 20044
nodes (153.27 seconds)
Cbc0001I Search completed - best objective 0, took 579240 iterations and
20044 nodes (153.58 seconds)
Cbc0035I Maximum depth 190, 0 variables fixed on reduced cost
"Finished"
Linearization cuts added at root node: 467
Linearization cuts added in total: 467 (separation time: 0s)
Total solve time: 153.592s (153.592s in
branch-and-bound)
Lower bound: 0
Upper bound: 0 (gap: 0.00%)
Branch-and-bound nodes: 20044
Stats: /tmp/tmpZ1I5T7.pyomo.nl 251 [var] 80 [int] 340 [con] 181 [aux]
467 [root] 467 [tot] 0 [sep] 153.592 [time] 153.592 [bb]
0.000000e+00 [lower] 0.000000e+00 [upper] 20044 [nodes]
Performance of FBBT: 6.948s, 16443 runs.
fix: 0.243451 shrnk: 2.40865 ubd: 0.661224 2ubd: 60 infeas:
0
It seems like the artificial cutoff is the same as that from ANALYSIS TEST.
The first case solves the problem at the root node by heuristic. However,
the second one doesn't. Could someone figure out why 20044 more nodes are
explored after giving the cutoff value artificially? Thanks!
Regards,
Suyun
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/couenne/attachments/20180327/d29dfe4c/attachment.html>
More information about the Couenne
mailing list