--- Job ran10x10c Start 08/24/08 05:43:59 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 --- ran10x10c.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/ran10x10c.gdx --- ran10x10c.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- ran10x10c.gms(123) 4 Mb --- Generating MIP model m --- ran10x10c.gms(124) 4 Mb --- 121 rows 201 columns 601 non-zeroes --- 100 discrete-columns --- Executing Cbc: elapsed 0:00:00.010 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 200 columns and 120 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 11203.1 - -0.00 seconds Optimal - objective value 11203.1 processed model has 120 rows, 200 columns (100 integer) and 400 elements Pass 1: suminf. 1.51345 (5) obj. 11655.2 iterations 21 Solution found of 14909 Before mini branch and bound, 85 integers at bound fixed and 85 continuous Full problem 120 rows 200 columns, reduced to 16 rows 18 columns Mini branch and bound improved solution from 14909 to 14743 (0.01 seconds) Round again with cutoff of 14389 Pass 2: suminf. 1.51345 (5) obj. 11665 iterations 19 Pass 3: suminf. 1.51345 (5) obj. 11665 iterations 4 Pass 4: suminf. 0.51895 (2) obj. 14389 iterations 24 Pass 5: suminf. 0.50786 (3) obj. 14389 iterations 15 Pass 6: suminf. 1.30743 (3) obj. 14389 iterations 20 Pass 7: suminf. 1.28895 (3) obj. 14389 iterations 4 Pass 8: suminf. 0.36326 (1) obj. 14389 iterations 21 Pass 9: suminf. 0.50000 (1) obj. 14252 iterations 12 Pass 10: suminf. 3.23526 (8) obj. 14389 iterations 92 Pass 11: suminf. 1.75296 (5) obj. 14389 iterations 27 Pass 12: suminf. 1.56740 (5) obj. 14389 iterations 6 Pass 13: suminf. 1.70970 (6) obj. 14389 iterations 26 Pass 14: suminf. 1.30523 (5) obj. 14389 iterations 8 Pass 15: suminf. 1.08085 (4) obj. 14389 iterations 24 Pass 16: suminf. 1.05020 (5) obj. 14389 iterations 17 Pass 17: suminf. 1.30523 (5) obj. 14389 iterations 17 Pass 18: suminf. 4.23059 (12) obj. 14389 iterations 61 Pass 19: suminf. 3.30099 (11) obj. 14389 iterations 24 Pass 20: suminf. 3.16797 (11) obj. 14389 iterations 10 Pass 21: suminf. 2.48241 (9) obj. 14389 iterations 2 No solution found this major pass Before mini branch and bound, 59 integers at bound fixed and 60 continuous Full problem 120 rows 200 columns, reduced to 56 rows 77 columns Mini branch and bound did not improve solution (0.09 seconds) After 0.09 seconds - Feasibility pump exiting with objective of 14743 - took 0.09 seconds Integer solution of 14743 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) Full problem 120 rows 200 columns, reduced to 0 rows 0 columns 40 added rows had average density of 39.025 At root node, 40 cuts changed objective from 11203.1 to 12457.6 in 100 passes Cut generator 0 (Probing) - 0 row cuts, 0 column cuts (0 active) in 1.844 seconds - new frequency is 1000 Cut generator 1 (Gomory) - 3073 row cuts, 0 column cuts (39 active) in 0.168 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 531 row cuts, 0 column cuts (1 active) in 0.088 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 303 row cuts, 0 column cuts (0 active) in 0.024 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 204 row cuts, 0 column cuts (0 active) in 0.108 seconds - new frequency is 1 Cut generator 6 (TwoMirCuts) - 264 row cuts, 0 column cuts (0 active) in 0.040 seconds - new frequency is -100 Optimal - objective value 12457.6 Optimal - objective value 12457.6 After 0 nodes, 1 on tree, 14743 best solution, best possible 12457.6 (2.96 seconds) Full problem 120 rows 200 columns, reduced to 22 rows 26 columns Full problem 120 rows 200 columns, reduced to 31 rows 38 columns Integer solution of 13007 found after 9780 iterations and 170 nodes (6.14 seconds) Full problem 120 rows 200 columns, reduced to 44 rows 58 columns Strong branching is fixing too many variables, too expensively! Search completed - best objective 13007, took 15975 iterations and 388 nodes (8.65 seconds) Strong branching done 5398 times (71940 iterations), fathomed 50 nodes and fixed 275 variables Maximum depth 32, 2070 variables fixed on reduced cost Cuts at root node changed objective from 11203.1 to 12457.6 Probing was tried 106 times and created 0 cuts of which 0 were active after adding rounds of cuts (1.848 seconds) Gomory was tried 700 times and created 3447 cuts of which 176 were active after adding rounds of cuts (0.436 seconds) Knapsack was tried 703 times and created 1659 cuts of which 471 were active after adding rounds of cuts (0.332 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) MixedIntegerRounding2 was tried 703 times and created 1241 cuts of which 355 were active after adding rounds of cuts (0.136 seconds) FlowCover was tried 703 times and created 1496 cuts of which 168 were active after adding rounds of cuts (0.276 seconds) TwoMirCuts was tried 100 times and created 264 cuts of which 0 were active after adding rounds of cuts (0.040 seconds) Result - Finished objective 13007 after 388 nodes and 15975 iterations - took 8.66 seconds (total time 8.66) Total time 8.66 Solved to optimality. MIP solution: 13007 (388 nodes, 8.67 seconds) Best possible: 13007 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- ran10x10c.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job ran10x10c.gms Stop 08/24/08 05:44:08 elapsed 0:00:08.721