--- Job enigma Start 08/21/08 21:28:06 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- enigma.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/enigma.gdx --- enigma.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- enigma.gms(123) 4 Mb --- Generating MIP model m --- enigma.gms(124) 4 Mb --- 22 rows 101 columns 299 non-zeroes --- 100 discrete-columns --- Executing COINCBC: elapsed 0:00:00.009 GAMS/CoinCbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 100 columns and 21 rows. 100 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jun 21 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 0 - 0.00 seconds processed model has 21 rows, 100 columns (100 integer) and 289 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.20955 obj. 0 iterations 17 Pass 2: suminf. 1.71569 obj. 0 iterations 17 Pass 3: suminf. 1.71569 obj. 0 iterations 14 Pass 4: suminf. 4.76060 obj. 2.85636 iterations 16 Pass 5: suminf. 1.44974 obj. 0 iterations 18 Pass 6: suminf. 1.44974 obj. 0 iterations 16 Pass 7: suminf. 0.06540 obj. 2.01869 iterations 18 Pass 8: suminf. 0.03364 obj. 2 iterations 16 Pass 9: suminf. 1.74824 obj. 2 iterations 26 Pass 10: suminf. 1.74824 obj. 2 iterations 17 Pass 11: suminf. 1.43300 obj. 2 iterations 16 Pass 12: suminf. 1.43300 obj. 2 iterations 7 Pass 13: suminf. 1.62308 obj. 2 iterations 19 Pass 14: suminf. 1.62308 obj. 2 iterations 21 Pass 15: suminf. 0.99710 obj. 3.75362 iterations 23 Pass 16: suminf. 0.55282 obj. 5 iterations 15 Pass 17: suminf. 1.66471 obj. 5 iterations 10 Pass 18: suminf. 1.66471 obj. 5 iterations 7 Pass 19: suminf. 1.34310 obj. 4.73138 iterations 25 Pass 20: suminf. 0.41288 obj. 5 iterations 15 No solution found this major pass Before mini branch and bound, 55 integers at bound fixed and 0 continuous Full problem 21 rows 100 columns, reduced to 20 rows 44 columns Mini branch and bound did not improve solution (0.06 seconds) Full problem 22 rows 100 columns, reduced to 22 rows 100 columns After 0.17 seconds - Feasibility pump exiting - took 0.17 seconds 1 added rows had average density of 99 At root node, 1 cuts changed objective from 0 to 0 in 14 passes Cut generator 0 (Probing) - 1 row cuts (0 active), 0 column cuts in 0.020 seconds - new frequency is 5 Cut generator 1 (Gomory) - 129 row cuts (1 active), 0 column cuts in 0.008 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 3 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 71 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.23 seconds) After 1000 nodes, 137 on tree, 1e+50 best solution, best possible 0 (1.62 seconds) After 2000 nodes, 142 on tree, 1e+50 best solution, best possible 0 (2.32 seconds) After 3000 nodes, 165 on tree, 1e+50 best solution, best possible 0 (3.00 seconds) Integer solution of 0 found after 17227 iterations and 3317 nodes (3.16 seconds) Search completed - best objective 0, took 17227 iterations and 3317 nodes (3.16 seconds) Strong branching done 15380 times (80718 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 29, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 433 times and created 114 cuts of which 47 were active after adding rounds of cuts (0.060 seconds) Gomory was tried 506 times and created 2252 cuts of which 280 were active after adding rounds of cuts (0.052 seconds) Knapsack was tried 14 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) FlowCover was tried 14 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 14 times and created 71 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Result - Finished objective 0 after 3317 nodes and 17227 iterations - took 3.19 seconds (total time 3.19) Total time 3.19 Solved to optimality. MIP solution: 0 (3317 nodes, 3.19 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- enigma.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job enigma.gms Stop 08/21/08 21:28:09 elapsed 0:00:03.239