--- Job mod008 Start 08/24/08 04:28:41 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 --- mod008.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/mod008.gdx --- mod008.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- mod008.gms(123) 4 Mb --- Generating MIP model m --- mod008.gms(124) 4 Mb --- 7 rows 320 columns 1,563 non-zeroes --- 319 discrete-columns --- Executing Cbc: elapsed 0:00:00.013 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Problem statistics: 319 columns and 6 rows. 319 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 290.931 - -0.00 seconds Optimal - objective value 290.931 processed model has 6 rows, 319 columns (319 integer) and 1243 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.05050 (1) obj. 310.939 iterations 7 Solution found of 385 Before mini branch and bound, 313 integers at bound fixed and 0 continuous Full problem 6 rows 319 columns, reduced to 5 rows 6 columns Mini branch and bound improved solution from 385 to 308 (0.01 seconds) Round again with cutoff of 305 Reduced cost fixing fixed 196 variables on major pass 2 Pass 2: suminf. 0.13407 (2) obj. 305 iterations 8 Pass 3: suminf. 1.21049 (4) obj. 305 iterations 3 Pass 4: suminf. 0.59044 (4) obj. 305 iterations 3 Pass 5: suminf. 0.60685 (4) obj. 305 iterations 8 Pass 6: suminf. 0.42877 (4) obj. 305 iterations 2 Pass 7: suminf. 1.58453 (5) obj. 305 iterations 4 Pass 8: suminf. 0.76773 (3) obj. 303.506 iterations 7 Pass 9: suminf. 0.13407 (2) obj. 305 iterations 4 Pass 10: suminf. 1.28286 (5) obj. 305 iterations 4 Pass 11: suminf. 1.49784 (5) obj. 305 iterations 4 Pass 12: suminf. 1.49784 (5) obj. 305 iterations 0 Pass 13: suminf. 0.35755 (3) obj. 305 iterations 8 Pass 14: suminf. 0.10301 (3) obj. 305 iterations 5 Pass 15: suminf. 1.63916 (5) obj. 305 iterations 6 Pass 16: suminf. 1.28286 (5) obj. 305 iterations 3 Pass 17: suminf. 1.49784 (5) obj. 305 iterations 4 Pass 18: suminf. 1.49784 (5) obj. 305 iterations 0 Pass 19: suminf. 0.35755 (3) obj. 305 iterations 8 Pass 20: suminf. 0.10301 (3) obj. 305 iterations 5 Pass 21: suminf. 1.63916 (5) obj. 305 iterations 6 No solution found this major pass Before mini branch and bound, 300 integers at bound fixed and 0 continuous Full problem 6 rows 319 columns, reduced to 5 rows 19 columns Mini branch and bound did not improve solution (0.02 seconds) After 0.02 seconds - Feasibility pump exiting with objective of 308 - took 0.02 seconds Integer solution of 308 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Full problem 6 rows 319 columns, reduced to 6 rows 6 columns Integer solution of 307 found by combine solutions after 0 iterations and 0 nodes (0.02 seconds) 14 added rows had average density of 146.571 At root node, 14 cuts changed objective from 290.931 to 301.582 in 100 passes Cut generator 0 (Probing) - 2 row cuts, 0 column cuts (0 active) in 0.644 seconds - new frequency is 6 Cut generator 1 (Gomory) - 1309 row cuts, 0 column cuts (9 active) in 0.060 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 246 row cuts, 0 column cuts (5 active) in 0.020 seconds - new frequency is 1 Cut generator 3 (Clique) - 0 row cuts, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 412 row cuts, 0 column cuts (0 active) in 0.056 seconds - new frequency is 1 Cut generator 5 (FlowCover) - 0 row cuts, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 197 row cuts, 0 column cuts (0 active) in 0.032 seconds - new frequency is -100 Optimal - objective value 301.582 Optimal - objective value 301.582 After 0 nodes, 1 on tree, 307 best solution, best possible 301.582 (0.96 seconds) Search completed - best objective 307, took 2198 iterations and 12 nodes (1.08 seconds) Strong branching done 318 times (2994 iterations), fathomed 1 nodes and fixed 12 variables Maximum depth 5, 691 variables fixed on reduced cost Cuts at root node changed objective from 290.931 to 301.582 Probing was tried 103 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.644 seconds) Gomory was tried 118 times and created 1361 cuts of which 9 were active after adding rounds of cuts (0.072 seconds) Knapsack was tried 118 times and created 369 cuts of which 21 were active after adding rounds of cuts (0.024 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) MixedIntegerRounding2 was tried 118 times and created 481 cuts of which 9 were active after adding rounds of cuts (0.068 seconds) FlowCover was tried 100 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 197 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) Result - Finished objective 307 after 12 nodes and 2198 iterations - took 1.08 seconds (total time 1.09) Total time 1.09 Solved to optimality. MIP solution: 307 (12 nodes, 1.09 seconds) Best possible: 307 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- mod008.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job mod008.gms Stop 08/24/08 04:28:42 elapsed 0:00:01.130