Welcome to IBM(R) ILOG(R) CPLEX(R) Interactive Optimizer 12.4.0.0 with Simplex, Mixed Integer & Barrier Optimizers 5725-A06 5725-A29 5724-Y48 5724-Y49 5724-Y54 5724-Y55 Copyright IBM Corp. 1988, 2011. All Rights Reserved. Type 'help' for a list of available commands. Type 'help' followed by a command name for more information on commands. CPLEX> Selected objective sense: MINIMIZE Selected objective name: obj Selected RHS name: rhs Selected bound name: bnd Problem 'in_i.mps.gz' read. Read time = 0.80 sec. CPLEX> Available MIP parameters: cuts set types of cuts used during mixed integer optimization display set level of mixed integer node display interval set interval for printing mixed integer node display limits set limits for mixed integer optimization ordertype set type of generated priority order polishafter set starting conditions for solution polishing pool set solution pool characteristics strategy set strategy for mixed integer optimization tolerances set tolerances for mixed integer optimization MIP parameter to set: Available mixed integer limits: aggforcut set constraint aggregation limit for cut generation auxrootthreads set number of threads to use for auxiliary root tasks cutpasses set number of cutting plane passes cutsfactor set rows multiplier factor to limit cuts eachcutlimit set limit on number of cuts for each type per pass gomorycand set candidate limit for generating Gomory fractional cuts gomorypass set pass limit for generating Gomory fractional cuts nodes set branch and cut node limit polishtime set time limit for polishing best solution populate set solutions limit for each populate call probetime set time limit for probing repairtries set number of times to try repair heuristic solutions set mixed integer solutions limit strongcand set strong branching candidate limit strongit set strong branching iteration limit submipnodelim set sub-MIP node limit treememory set upper limit on size of tree in megabytes Mixed integer limit to set: Present value for mixed integer solutions limit: 9223372036800000000 New value for mixed integer solutions limit: New value for mixed integer solutions limit: 1 CPLEX> Present value for time limit in seconds: 1e+75 New value for time limit in seconds: New value for time limit in seconds: 3600 CPLEX> Tried aggregator 2 times. MIP Presolve eliminated 4845 rows and 12808 columns. MIP Presolve modified 352 coefficients. Aggregator did 3619 substitutions. Reduced MIP has 125480 rows, 428198 columns, and 999689 nonzeros. Reduced MIP has 37290 binaries, 388890 generals, 0 SOSs, and 0 indicators. Probing fixed 0 vars, tightened 382 bounds. Probing time = 0.49 sec. Tried aggregator 2 times. MIP Presolve eliminated 14 rows and 6 columns. MIP Presolve modified 16 coefficients. Aggregator did 27 substitutions. Reduced MIP has 125439 rows, 428165 columns, and 999634 nonzeros. Reduced MIP has 37290 binaries, 389673 generals, 0 SOSs, and 0 indicators. Presolve time = 2.03 sec. Probing time = 0.10 sec. Clique table members: 631. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 115.68 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 12121.3581 898 12121.3581 159992 0 0 12199.0190 1997 Cuts: 337 163190 0 0 12394.8149 2006 Cuts: 300 167266 0 0 12505.6030 2057 Cuts: 332 170917 0 0 12547.3373 2396 Cuts: 307 175318 0 0 12576.3082 2555 Cuts: 350 178393 0 0 12639.7645 2139 Cuts: 346 182768 0 0 12652.7611 2210 Cuts: 325 185759 0 0 12678.4869 2068 Cuts: 323 189758 0 0 12705.7926 2231 Cuts: 297 192138 0 0 12731.8061 2156 Cuts: 319 195092 0 0 12744.0584 1828 Cuts: 325 200216 0 0 12757.4219 2485 Cuts: 297 203511 0 0 12770.4611 2504 Cuts: 320 208572 0 0 12786.0856 2748 Cuts: 262 211399 0 0 12799.0548 2295 Cuts: 290 216967 0 0 12813.5112 2356 Cuts: 322 221111 0 0 12822.3860 2769 Cuts: 342 223303 0 0 12826.9510 2627 Cuts: 320 225956 0 0 12837.9266 2962 Cuts: 349 229378 0 0 12842.1278 2670 Cuts: 373 233172 0 0 12855.5821 2678 Cuts: 407 236728 0 0 12856.0781 2681 Cuts: 365 239634 0 0 12865.8030 3009 Cuts: 302 243257 0 0 12866.9687 3013 Cuts: 363 245960 Heuristic still looking. 0 2 12866.9687 3013 12866.9687 245960 Elapsed real time = 659.22 sec. (tree size = 0.01 MB, solutions = 0) 1 3 12899.6021 1808 12866.9687 249703 2 4 12985.4968 1359 12866.9687 256339 4 6 13050.7800 1652 12866.9687 263578 5 7 13039.8103 1452 12880.0923 267469 8 10 13085.4255 1685 12880.0923 275127 9 11 13045.9746 1500 12880.0923 296903 10 12 13142.5966 1637 12880.0923 319269 12 14 13052.1150 1303 12880.0923 353591 15 17 13128.3306 693 12880.0923 382069 16 18 13066.0508 1448 12880.0923 388149 Elapsed real time = 797.62 sec. (tree size = 0.13 MB, solutions = 0) 17 19 13063.3587 1209 12880.0923 390265 21 23 13075.9956 1064 12880.0923 399489 24 26 13388.8995 496 12880.0923 403694 28 30 13395.3871 801 12880.0923 415567 31 33 13046.0574 1378 12880.0923 426532 35 37 13051.9947 1552 12880.0923 433311 40 42 13247.3010 455 12880.0923 446941 44 46 13262.7677 846 12880.0923 451297 48 50 13280.2245 552 12880.0923 463140 52 54 13280.3008 861 12880.0923 469314 Elapsed real time = 943.06 sec. (tree size = 3.05 MB, solutions = 0) 61 63 13280.2580 621 12880.0923 488299 65 67 13290.6602 552 12880.0923 511070 69 71 13297.4834 453 12880.0923 516058 70 72 13437.9508 965 12880.0923 521504 73 75 13297.5493 353 12880.0923 526334 74 76 13355.9232 819 12880.0923 528169 77 79 13297.5493 355 12880.0923 532141 81 83 13297.5771 382 12880.0923 535634 85 87 13297.5910 320 12880.0923 539873 86 88 13386.1812 549 12880.0923 542509 Elapsed real time = 1025.56 sec. (tree size = 4.28 MB, solutions = 0) 96 98 13297.6327 482 12880.0923 554630 98 100 13188.4318 109 12880.0923 555916 99 101 13412.1932 471 12880.0923 557753 103 105 13419.9050 387 12880.0923 567186 107 109 13431.9052 859 12880.0923 574458 119 121 13432.1217 87 12880.0923 591269 123 125 13432.1217 55 12880.0923 597557 127 129 13432.1563 69 12880.0923 599945 131 133 13432.2226 48 12880.0923 603912 137 139 13446.9980 612 12880.0923 613591 Elapsed real time = 1135.61 sec. (tree size = 6.89 MB, solutions = 0) 139 141 13432.6881 48 12880.0923 615988 163 165 13456.3320 633 12880.0923 633490 167 169 13456.2246 962 12880.0923 640294 171 173 13467.8662 762 12880.0923 649238 175 177 13467.9044 631 12880.0923 654317 179 181 13467.9356 585 12880.0923 657699 183 185 13467.9460 605 12880.0923 660423 187 189 13467.9564 590 12880.0923 661627 191 193 13472.0547 181 12880.0923 666298 207 209 13479.0785 198 12880.0923 672450 Elapsed real time = 1208.49 sec. (tree size = 24.96 MB, solutions = 0) 211 213 13479.0785 69 12880.0923 674553 215 217 13479.1368 67 12880.0923 678375 219 221 13479.2445 94 12880.0923 681725 * 230+ 230 13483.3467 12880.0923 687682 4.47% * 239 233 integral 0 13196.0626 12880.0923 689570 2.39% Implied bound cuts applied: 113 Flow cuts applied: 613 Mixed integer rounding cuts applied: 105 Flow path cuts applied: 2 Zero-half cuts applied: 29 Root node processing (before b&c): Real time = 656.87 Parallel b&c, 4 threads: Real time = 558.61 Sync time (average) = 0.01 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 1215.48 sec. Solution pool: 3 solutions saved. MIP - Solution limit exceeded, integer feasible: Objective = 1.3196062606e+04 Current MIP best bound = 1.2880092318e+04 (gap = 315.97, 2.39%) Solution time = 1217.57 sec. Iterations = 692766 Nodes = 246 (89) Deterministic time = 681270.75 ticks (559.53 ticks/sec) CPLEX> 3149.06user 5.27system 20:18.40elapsed 258%CPU (0avgtext+0avgdata 7506144maxresident)k 0inputs+1112outputs (0major+4533829minor)pagefaults 0swaps