--- Job enigma Start 08/24/08 01:43:06 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.004 --- 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 Cbc: elapsed 0:00:00.008 GAMS/Cbc 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.20.00, build Aug 23 2008 command line - GAMS/CBC -solve -quit Continuous objective value is 0 - -0.00 seconds Optimal - objective value 0 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 (4) obj. 0 iterations 31 Pass 2: suminf. 0.20955 (4) obj. 0 iterations 0 Pass 3: suminf. 1.50203 (8) obj. 0 iterations 19 Pass 4: suminf. 0.88340 (4) obj. 0 iterations 22 Pass 5: suminf. 0.88340 (4) obj. 0 iterations 0 Pass 6: suminf. 1.92282 (4) obj. 1.55789 iterations 19 Pass 7: suminf. 0.99033 (4) obj. 0 iterations 29 Pass 8: suminf. 0.99033 (4) obj. 0 iterations 0 Pass 9: suminf. 0.99033 (4) obj. 0 iterations 0 Pass 10: suminf. 0.61997 (10) obj. 1 iterations 25 Pass 11: suminf. 0.23813 (4) obj. 1 iterations 31 Pass 12: suminf. 0.23813 (4) obj. 1 iterations 0 Pass 13: suminf. 2.28417 (6) obj. 1 iterations 21 Pass 14: suminf. 1.15270 (4) obj. 1 iterations 15 Pass 15: suminf. 1.15270 (4) obj. 1 iterations 0 Pass 16: suminf. 2.22337 (8) obj. 1 iterations 8 Pass 17: suminf. 1.20523 (4) obj. 1 iterations 15 Pass 18: suminf. 1.20523 (4) obj. 1 iterations 0 Pass 19: suminf. 0.62771 (4) obj. 3 iterations 25 Pass 20: suminf. 0.62771 (4) obj. 3 iterations 23 No solution found this major pass Before mini branch and bound, 49 integers at bound fixed and 0 continuous Full problem 21 rows 100 columns, reduced to 21 rows 51 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.18 seconds - Feasibility pump exiting - took 0.18 seconds 2 added rows had average density of 71.5 At root node, 2 cuts changed objective from 0 to 0 in 8 passes Cut generator 0 (Probing) - 1 row cuts, 0 column cuts (0 active) in 0.088 seconds - new frequency is 2 Cut generator 1 (Gomory) - 78 row cuts, 0 column cuts (2 active) in 0.000 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 1 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 97 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Optimal - objective value 0 Optimal - objective value 0 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.30 seconds) Search completed - best objective 0, took 3767 iterations and 330 nodes (1.06 seconds) Strong branching done 4114 times (21969 iterations), fathomed 74 nodes and fixed 280 variables Maximum depth 14, 304 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 190 times and created 230 cuts of which 16 were active after adding rounds of cuts (0.108 seconds) Gomory was tried 140 times and created 696 cuts of which 48 were active after adding rounds of cuts (0.024 seconds) Knapsack was tried 8 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 8 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 8 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 8 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 8 times and created 97 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) implication was tried 327 times and created 13 cuts of which 8 were active after adding rounds of cuts Result - Finished objective 0 after 330 nodes and 3767 iterations - took 1.07 seconds (total time 1.07) Total time 1.08 Solved to optimality. MIP solution: 0 (330 nodes, 1.08 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/24/08 01:43:07 elapsed 0:00:01.147