ILOG CPLEX 11.100, licensed to "university-bayreuth", options: e m b q p=2 MaintenanceEnd=20090831 Welcome to CPLEX Interactive Optimizer 11.1.0 with Simplex, Mixed Integer & Barrier Optimizers Copyright (c) ILOG 1997-2008 CPLEX is a registered trademark of ILOG Type 'help' for a list of available commands. Type 'help' followed by a command name for more information on commands. CPLEX> read code9.lp Problem 'code9.lp' read. Read time = 0.01 sec. CPLEX> opt Tried aggregator 1 time. MIP Presolve eliminated 0 rows and 1 columns. MIP Presolve modified 10334 coefficients. Reduced MIP has 144 rows, 143 columns, and 16050 nonzeros. Presolve time = 0.03 sec. Clique table members: 1. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.01 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 1.0000 16 1.0000 61 0 0 1.0000 14 Cuts: 5 74 0 2 1.0000 14 1.0000 74 100 70 1.0000 14 1.0000 4522 200 122 infeasible 1.0000 9167 300 161 infeasible 1.0000 14673 400 223 1.0000 13 1.0000 19596 500 271 1.0000 13 1.0000 25806 600 292 1.0000 14 1.0000 28607 700 291 1.0000 17 1.0000 31377 800 296 1.0000 12 1.0000 34430 900 304 1.0000 19 1.0000 37951 1000 315 infeasible 1.0000 41434 Elapsed real time = 4.26 sec. (tree size = 0.06 MB, solutions = 0) 1100 367 infeasible 1.0000 44247 1200 421 1.0000 16 1.0000 47891 1300 467 infeasible 1.0000 51664 1400 519 infeasible 1.0000 55376 1500 564 1.0000 15 1.0000 59288 1600 618 infeasible 1.0000 63131 1700 661 infeasible 1.0000 66930 1800 722 1.0000 12 1.0000 70377 1900 760 1.0000 12 1.0000 74684 2000 828 1.0000 11 1.0000 77883 Elapsed real time = 7.14 sec. (tree size = 0.16 MB, solutions = 0) 2100 882 1.0000 13 1.0000 81838 2200 914 1.0000 11 1.0000 85915 2300 952 1.0000 14 1.0000 90173 2400 996 1.0000 18 1.0000 94133 2500 1040 1.0000 13 1.0000 98218 2600 1078 1.0000 19 1.0000 102309 2700 1114 infeasible 1.0000 106544 2800 1152 1.0000 22 1.0000 110837 2900 1194 1.0000 16 1.0000 115005 3000 1238 1.0000 15 1.0000 119552 Elapsed real time = 11.51 sec. (tree size = 0.26 MB, solutions = 0) 3100 1273 1.0000 13 1.0000 124423 3200 1317 1.0000 18 1.0000 128395 3300 1368 1.0000 14 1.0000 132018 3400 1408 infeasible 1.0000 135987 3500 1440 1.0000 14 1.0000 140122 3600 1482 1.0000 19 1.0000 144335 3700 1528 1.0000 18 1.0000 148586 3800 1570 1.0000 24 1.0000 152893 3900 1603 1.0000 19 1.0000 157383 4000 1633 1.0000 16 1.0000 162008 Elapsed real time = 16.93 sec. (tree size = 0.34 MB, solutions = 0) 4100 1657 1.0000 10 1.0000 166844 4200 1695 infeasible 1.0000 171824 4300 1739 1.0000 12 1.0000 176090 * 4391 1769 integral 0 1.0000 1.0000 179787 0.00% GUB cover cuts applied: 3 Cover cuts applied: 461 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 0.46 Parallel b&c, 2 threads: Real time = 19.01 Sync time (average) = 0.50 Wait time (average) = 1.15 ------- Total (root+branch&cut) = 19.47 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 1.0000000000e+00 Solution time = 19.51 sec. Iterations = 179848 Nodes = 4393 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value y0 1.000000 x45 1.000000 x79 1.000000 x84 1.000000 x86 1.000000 x104 1.000000 x115 1.000000 x119 1.000000 x121 1.000000 x127 1.000000 x128 1.000000 x139 1.000000 x142 1.000000 All other variables in the range 1-144 are 0.