--- Job stein27 Start 08/24/08 08:20:13 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 --- stein27.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/stein27.gdx --- stein27.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.004 --- stein27.gms(123) 4 Mb --- Generating MIP model m --- stein27.gms(124) 4 Mb --- 119 rows 28 columns 406 non-zeroes --- 27 discrete-columns --- Executing Cbc: elapsed 0:00:00.008 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 27 columns and 118 rows. 27 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 13 - -0.00 seconds Optimal - objective value 13 processed model has 118 rows, 27 columns (27 integer) and 378 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 7.00000 (21) obj. 13 iterations 0 Solution found of 27 Before mini branch and bound, 6 integers at bound fixed and 0 continuous Full problem 118 rows 27 columns, reduced to 54 rows 21 columns Mini branch and bound improved solution from 27 to 18 (0.05 seconds) Round again with cutoff of 16 Pass 2: suminf. 7.00000 (21) obj. 13 iterations 0 Pass 3: suminf. 5.33333 (18) obj. 16 iterations 22 Pass 4: suminf. 3.33333 (27) obj. 16 iterations 15 Pass 5: suminf. 3.33333 (27) obj. 16 iterations 1 Pass 6: suminf. 6.66667 (20) obj. 13.6667 iterations 42 Pass 7: suminf. 4.86667 (18) obj. 16 iterations 34 Pass 8: suminf. 4.33333 (13) obj. 16 iterations 11 Pass 9: suminf. 4.00000 (18) obj. 16 iterations 29 Pass 10: suminf. 3.33333 (27) obj. 16 iterations 5 Pass 11: suminf. 9.28571 (24) obj. 13 iterations 6 Pass 12: suminf. 5.66667 (17) obj. 16 iterations 34 Pass 13: suminf. 4.33333 (13) obj. 16 iterations 15 Pass 14: suminf. 4.33333 (13) obj. 16 iterations 10 Pass 15: suminf. 4.53333 (18) obj. 16 iterations 29 Pass 16: suminf. 4.33333 (13) obj. 15.6667 iterations 30 Pass 17: suminf. 4.00000 (12) obj. 16 iterations 6 Pass 18: suminf. 4.50000 (18) obj. 16 iterations 22 Pass 19: suminf. 4.50000 (18) obj. 16 iterations 4 Pass 20: suminf. 4.00000 (12) obj. 16 iterations 34 Pass 21: suminf. 5.09524 (21) obj. 16 iterations 29 No solution found this major pass Before mini branch and bound, 0 integers at bound fixed and 0 continuous Full problem 118 rows 27 columns, reduced to 118 rows 27 columns Mini branch and bound did not improve solution (0.13 seconds) After 0.13 seconds - Feasibility pump exiting with objective of 18 - took 0.13 seconds Integer solution of 18 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) Full problem 118 rows 27 columns, reduced to 0 rows 0 columns 5 added rows had average density of 16.6 At root node, 5 cuts changed objective from 13 to 13 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 2382 row cuts, 0 column cuts (5 active) in 0.032 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 0 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.004 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts, 0 column cuts (0 active) in 0.020 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 140 row cuts, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Optimal - objective value 13 Optimal - objective value 13 After 0 nodes, 1 on tree, 18 best solution, best possible 13 (0.39 seconds) Search completed - best objective 18, took 10362 iterations and 584 nodes (2.37 seconds) Strong branching done 8512 times (62741 iterations), fathomed 245 nodes and fixed 24 variables Maximum depth 11, 9 variables fixed on reduced cost Cuts at root node changed objective from 13 to 13 Probing was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Gomory was tried 444 times and created 7841 cuts of which 400 were active after adding rounds of cuts (0.108 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) MixedIntegerRounding2 was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.020 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 100 times and created 140 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Finished objective 18 after 584 nodes and 10362 iterations - took 2.37 seconds (total time 2.37) Total time 2.38 Solved to optimality. MIP solution: 18 (584 nodes, 2.38 seconds) Best possible: 18 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- stein27.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job stein27.gms Stop 08/24/08 08:20:16 elapsed 0:00:02.415