--- Job enigma Start 08/21/08 07:01:44 GAMS Rev 227 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.005 --- 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.0 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.00.00, build Mar 20 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: obj. 2.02663 --> up = 2 , down = 2 Pass 2: obj. 1.49245 --> up = 0 , down = 0 -- rand = 4 ( 19) Pass 3: obj. 2.50755 --> up = 2 , down = 2 perturbation applied Pass 4: obj. 18.85669 --> up = 1 , down = 17 Pass 5: obj. 2.37553 --> up = 2 , down = 2 Pass 6: obj. 1.40099 --> up = 0 , down = 0 -- rand = 4 ( 28) Pass 7: obj. 2.21851 --> up = 2 , down = 2 Pass 8: obj. 1.78149 --> up = 0 , down = 0 -- rand = 4 ( 19) perturbation applied Pass 9: obj. 15.00000 --> up = 0 , down = 15 Pass 10: obj. 1.37282 --> up = 0 , down = 0 -- rand = 4 ( 14) Pass 11: obj. 1.74202 --> up = 0 , down = 0 -- rand = 4 ( 12) Pass 12: obj. 2.25798 --> up = 2 , down = 2 perturbation applied Pass 13: obj. 29.00000 --> up = 0 , down = 29 Pass 14: obj. 0.95940 --> up = 0 , down = 0 -- rand = 4 ( 25) Pass 15: obj. 2.25027 --> up = 2 , down = 2 Pass 16: obj. 1.49170 --> up = 0 , down = 0 -- rand = 4 ( 12) Pass 17: obj. 2.50830 --> up = 2 , down = 2 perturbation applied Pass 18: obj. 14.00000 --> up = 1 , down = 13 Pass 19: obj. 1.70652 --> up = 0 , down = 0 -- rand = 4 ( 10) Pass 20: obj. 2.29348 --> No solution found this major pass Before mini branch and bound, 63 integers at bound fixed and 0 continuous Full problem 21 rows 100 columns, reduced to 17 rows 35 columns Mini branch and bound did not improve solution (0.02 seconds) Full problem 22 rows 100 columns, reduced to 22 rows 100 columns After 0.11 seconds - Feasibility pump exiting - took 0.11 seconds 1 added rows had average density of 61 At root node, 1 cuts changed objective from 0 to 0 in 7 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is 10 Cut generator 1 (Gomory) - 36 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 2 (Knapsack) - 2 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.000 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) - 74 row cuts (1 active), 0 column cuts in 0.008 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.13 seconds) After 1000 nodes, 131 on tree, 1e+50 best solution, best possible 0 (1.75 seconds) After 2000 nodes, 120 on tree, 1e+50 best solution, best possible 0 (2.71 seconds) After 3000 nodes, 111 on tree, 1e+50 best solution, best possible 0 (3.52 seconds) Integer solution of 1 found after 24547 iterations and 3047 nodes (3.54 seconds) After 4000 nodes, 109 on tree, 1 best solution, best possible 0 (4.78 seconds) After 5000 nodes, 134 on tree, 1 best solution, best possible 0 (5.70 seconds) Integer solution of 0 found after 47986 iterations and 5740 nodes (6.14 seconds) Search completed - best objective 0, took 47986 iterations and 5740 nodes (6.14 seconds) Strong branching done 21930 times (191967 iterations), fathomed 0 nodes and fixed 0 variables Maximum depth 28, 308 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 309 times and created 59 cuts of which 15 were active after adding rounds of cuts (0.052 seconds) Gomory was tried 7 times and created 36 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Knapsack was tried 7 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 7 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 7 times and created 74 cuts of which 1 were active after adding rounds of cuts (0.008 seconds) Result - Finished objective 0 after 5740 nodes and 47986 iterations - took 6.16 seconds (total time 6.16) Total time 6.17 Solved to optimality. Writing solution. Objective: 0 Time: 6.16 s --- Restarting execution --- enigma.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job enigma.gms Stop 08/21/08 07:01:51 elapsed 0:00:06.285