--- Job misc03 Start 08/21/08 08:28:58 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 --- misc03.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/misc03.gdx --- misc03.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- misc03.gms(123) 4 Mb --- Generating MIP model m --- misc03.gms(124) 4 Mb --- 97 rows 161 columns 2,055 non-zeroes --- 159 discrete-columns --- Executing COINCBC: elapsed 0:00:00.013 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 160 columns and 96 rows. 159 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 1910 - -0.00 seconds 15 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions 15 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions processed model has 95 rows, 138 columns (138 integer) and 1824 elements Objective coefficients multiple of 5 Cutoff increment increased from 1e-05 to 4.995 Pass 1: obj. 6.00000 --> up = 0 , down = 0 -- rand = 12 ( 21) Pass 2: obj. 6.00000 --> up = 0 , down = 12 perturbation applied Pass 3: obj. 26.83333 --> up = 0 , down = 33 Pass 4: obj. 6.33333 --> up = 1 , down = 0 Pass 5: obj. 5.66667 --> up = 1 , down = 0 Pass 6: obj. 5.00000 --> up = 0 , down = 0 -- rand = 20 ( 20) Pass 7: obj. 15.36364 --> up = 1 , down = 18 Pass 8: obj. 4.66667 --> up = 0 , down = 0 -- rand = 19 ( 19) Pass 9: obj. 13.75000 --> up = 2 , down = 17 perturbation applied Pass 10: obj. 23.83333 --> up = 0 , down = 26 Pass 11: obj. 5.33333 --> up = 0 , down = 0 -- rand = 14 ( 21) Pass 12: obj. 7.50000 --> up = 0 , down = 13 Pass 13: obj. 5.00000 --> up = 3 , down = 0 Pass 14: obj. 4.66667 --> up = 0 , down = 0 -- rand = 15 ( 28) Pass 15: obj. 9.50000 --> up = 0 , down = 9 Pass 16: obj. 5.00000 --> up = 0 , down = 3 perturbation applied Pass 17: obj. 21.16667 --> up = 1 , down = 24 Pass 18: obj. 5.00000 --> up = 3 , down = 0 Pass 19: obj. 4.66667 --> up = 0 , down = 0 -- rand = 16 ( 27) Pass 20: obj. 10.50000 --> No solution found this major pass Before mini branch and bound, 74 integers at bound fixed and 0 continuous Full problem 95 rows 138 columns, reduced to 91 rows 64 columns Mini branch and bound did not improve solution (0.06 seconds) Full problem 96 rows 138 columns, reduced to 96 rows 138 columns After 0.25 seconds - Feasibility pump exiting - took 0.25 seconds 13 added rows had average density of 88.1538 At root node, 13 cuts changed objective from 1910 to 2195.24 in 100 passes Cut generator 0 (Probing) - 0 row cuts (0 active), 0 column cuts in 0.516 seconds - new frequency is 10 Cut generator 1 (Gomory) - 2500 row cuts (12 active), 0 column cuts in 0.084 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 49 row cuts (1 active), 0 column cuts in 0.048 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) - 139 row cuts (0 active), 0 column cuts in 0.040 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 2195.24 (1.42 seconds) Integer solution of 3920 found by rounding after 3636 iterations and 10 nodes (1.69 seconds) Full problem 95 rows 138 columns, reduced to 0 rows 0 columns Strong branching is fixing too many variables, too expensively! Search completed - best objective 3360, took 6576 iterations and 120 nodes (3.15 seconds) Strong branching done 1636 times (36762 iterations), fathomed 31 nodes and fixed 150 variables Maximum depth 30, 2424 variables fixed on reduced cost Cuts at root node changed objective from 1910 to 2195.24 Probing was tried 109 times and created 13 cuts of which 4 were active after adding rounds of cuts (0.520 seconds) Gomory was tried 193 times and created 2563 cuts of which 36 were active after adding rounds of cuts (0.108 seconds) Knapsack was tried 100 times and created 49 cuts of which 1 were active after adding rounds of cuts (0.048 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 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 100 times and created 139 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Result - Finished objective 3360 after 120 nodes and 6576 iterations - took 3.33 seconds (total time 3.33) Total time 3.33 Solved to optimality. Writing solution. Objective: 3360 Time: 3.34 s --- Restarting execution --- misc03.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job misc03.gms Stop 08/21/08 08:29:01 elapsed 0:00:03.392