--- Job p0282 Start 08/21/08 11:33:30 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 --- p0282.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/p0282.gdx --- p0282.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.010 --- p0282.gms(123) 4 Mb --- Generating MIP model m --- p0282.gms(124) 4 Mb --- 242 rows 283 columns 2,249 non-zeroes --- 282 discrete-columns --- p0282.gms(124) 4 Mb --- Executing COINCBC: elapsed 0:00:00.019 GAMS/CoinCbc 2.0 LP/MIP Solver written by J. Forrest Problem statistics: 282 columns and 241 rows. 282 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 176868 - 0.00 seconds processed model has 161 rows, 202 columns (202 integer) and 1284 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: obj. 1.97059 --> up = 1 , down = 0 Pass 2: obj. 1.47059 --> up = 0 , down = 0 -- rand = 9 ( 20) - solution found of 564656 Before mini branch and bound, 177 integers at bound fixed and 0 continuous Full problem 161 rows 202 columns, reduced to 6 rows 9 columns Mini branch and bound improved solution from 564656 to 346980 (0.01 seconds) Round again with cutoff of 330282 Pass 3: obj. 1.87092 --> up = 1 , down = 0 Pass 4: obj. 1.37092 --> up = 0 , down = 0 -- rand = 8 ( 19) Pass 5: obj. 1.28700 --> up = 0 , down = 2 Pass 6: obj. 0.31536 --> up = 0 , down = 0 -- rand = 2 ( 15) perturbation applied Pass 7: obj. 2.96122 --> up = 1 , down = 1 Pass 8: obj. 0.96122 --> up = 0 , down = 0 -- rand = 6 ( 29) Pass 9: obj. 2.49332 --> up = 0 , down = 3 Pass 10: obj. 0.43137 --> up = 0 , down = 0 -- rand = 3 ( 24) perturbation applied Pass 11: obj. 5.92570 --> up = 2 , down = 3 Pass 12: obj. 1.42570 --> up = 0 , down = 0 -- rand = 7 ( 15) Pass 13: obj. 2.71739 --> up = 1 , down = 2 Pass 14: obj. 1.36587 --> up = 0 , down = 1 Pass 15: obj. 1.07101 --> up = 0 , down = 0 -- rand = 4 ( 19) perturbation applied Pass 16: obj. 9.60469 --> up = 2 , down = 6 Pass 17: obj. 2.81549 --> up = 0 , down = 0 -- rand = 8 ( 16) Pass 18: obj. 3.00710 --> up = 1 , down = 3 Pass 19: obj. 1.79327 --> up = 0 , down = 0 -- rand = 6 ( 19) Pass 20: obj. 4.01686 --> up = 3 , down = 1 Pass 21: obj. 2.10129 --> up = 0 , down = 2 perturbation applied Pass 22: obj. 5.67454 --> No solution found this major pass Before mini branch and bound, 87 integers at bound fixed and 0 continuous Full problem 161 rows 202 columns, reduced to 33 rows 74 columns Mini branch and bound did not improve solution (0.03 seconds) After 0.03 seconds - Feasibility pump exiting - took 0.03 seconds Integer solution of 346980 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Full problem 161 rows 202 columns, reduced to 2 rows 7 columns Integer solution of 341650 found by combine solutions after 3012 iterations and 0 nodes (1.75 seconds) 51 added rows had average density of 28.0392 At root node, 51 cuts changed objective from 180000 to 257208 in 100 passes Cut generator 0 (Probing) - 267 row cuts (5 active), 0 column cuts in 0.916 seconds - new frequency is 1 Cut generator 1 (Gomory) - 3418 row cuts (9 active), 0 column cuts in 0.128 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 832 row cuts (23 active), 0 column cuts in 0.076 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.016 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 782 row cuts (6 active), 0 column cuts in 0.148 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in -0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 750 row cuts (8 active), 0 column cuts in 0.064 seconds - new frequency is -100 After 0 nodes, 1 on tree, 341650 best solution, best possible 257208 (1.90 seconds) Integer solution of 340170 found by combine solutions after 3094 iterations and 1 nodes (1.93 seconds) Integer solution of 277972 found by rounding after 5262 iterations and 43 nodes (2.90 seconds) Full problem 161 rows 202 columns, reduced to 29 rows 53 columns Integer solution of 263113 found by combine solutions after 5284 iterations and 44 nodes (3.06 seconds) Integer solution of 258945 found after 5536 iterations and 49 nodes (3.13 seconds) Search completed - best objective 258411, took 5636 iterations and 53 nodes (3.16 seconds) Strong branching done 1596 times (19734 iterations), fathomed 4 nodes and fixed 30 variables Maximum depth 8, 404 variables fixed on reduced cost Cuts at root node changed objective from 180000 to 257208 Probing was tried 151 times and created 333 cuts of which 29 were active after adding rounds of cuts (0.944 seconds) Gomory was tried 151 times and created 3618 cuts of which 81 were active after adding rounds of cuts (0.144 seconds) Knapsack was tried 151 times and created 1593 cuts of which 174 were active after adding rounds of cuts (0.116 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) MixedIntegerRounding2 was tried 151 times and created 1375 cuts of which 158 were active after adding rounds of cuts (0.180 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 750 cuts of which 8 were active after adding rounds of cuts (0.064 seconds) Result - Finished objective 258411 after 53 nodes and 5636 iterations - took 3.18 seconds (total time 3.18) Total time 3.18 Solved to optimality. Writing solution. Objective: 258411 Time: 3.19 s --- Restarting execution --- p0282.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job p0282.gms Stop 08/21/08 11:33:33 elapsed 0:00:03.248