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: R24497 Selected RHS name: B Selected bound name: BOUND Problem 'in_i.mps.gz' read. Read time = 0.06 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 106 rows and 1 columns. MIP Presolve modified 364 coefficients. Aggregator did 210 substitutions. Reduced MIP has 24180 rows, 22485 columns, and 102977 nonzeros. Reduced MIP has 22470 binaries, 1 generals, 0 SOSs, and 0 indicators. Probing time = 0.06 sec. Tried aggregator 1 time. MIP Presolve eliminated 105 rows and 105 columns. Reduced MIP has 24075 rows, 22380 columns, and 102662 nonzeros. Reduced MIP has 22365 binaries, 1 generals, 0 SOSs, and 0 indicators. Presolve time = 0.46 sec. Probing time = 0.01 sec. Clique table members: 22290. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 2.00 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 817.1937 5084 817.1937 25 0 0 818.0000 3817 Cuts: 17 13904 0 0 860.9852 5117 Cuts: 229 36649 0 0 891.1429 6022 Cuts: 271 63042 0 0 891.3965 6279 Cuts: 213 95269 0 0 892.5891 5587 Cuts: 101 97966 0 0 892.6531 5517 Cuts: 87 98525 0 0 892.7462 5409 Cuts: 70 99141 0 0 892.7469 5377 Cuts: 41 99294 0 0 892.7474 5334 Cuts: 52 99451 0 0 892.7474 5299 Cuts: 23 99522 0 0 892.7474 5254 ZeroHalf: 24 99607 0 0 892.7474 5243 ZeroHalf: 3 99635 Heuristic still looking. Heuristic still looking. 0 2 892.7474 2419 892.7474 99635 Elapsed real time = 257.07 sec. (tree size = 0.01 MB, solutions = 0) 1 3 1050.0000 5377 892.7474 145687 2 4 894.2363 2402 892.7474 147139 3 5 1050.0000 5255 894.2373 183221 6 8 894.9846 2419 894.2373 251406 7 9 4575.0000 8685 894.2373 270504 9 11 1050.0000 6906 894.2373 318235 11 13 895.5510 2429 894.9937 354588 12 14 1050.0000 7113 894.9937 385180 13 15 1050.0000 7123 894.9937 416932 15 15 1050.0000 5253 894.9937 450319 Elapsed real time = 547.27 sec. (tree size = 0.32 MB, solutions = 0) 16 16 4575.0000 8906 894.9937 470869 19 19 1050.0000 5244 894.9937 526441 20 20 897.0935 2465 896.2491 527594 21 21 1050.0000 7176 896.2491 555223 22 22 1050.0000 7253 896.2491 583831 24 24 1050.0000 5102 896.2491 620467 32 32 902.0719 2563 897.1000 740069 36 36 904.8684 2865 897.1000 756536 37 37 4575.0000 9557 897.1000 796670 41 41 1050.0000 7378 897.1000 857478 Elapsed real time = 1016.09 sec. (tree size = 0.74 MB, solutions = 0) 45 45 4575.0000 8623 897.1000 894539 65 65 910.6774 2529 904.8684 1187416 66 66 1050.0000 7027 904.8684 1228321 68 68 1050.0000 6633 904.8684 1279265 72 72 1050.0000 6423 904.8684 1299041 74 74 1050.0000 7798 904.8684 1323120 78 78 1050.0000 6682 904.8684 1377234 86 86 1050.0000 7286 904.8684 1432871 88 88 1500.0000 6497 904.8684 1500695 135 135 982.2725 4146 904.8684 1888085 Elapsed real time = 1539.42 sec. (tree size = 0.52 MB, solutions = 0) 136 136 932.7233 2480 904.8684 1893952 138 138 1646.7800 4303 904.8684 1925795 139 139 1050.0000 6357 904.8684 1975680 143 143 1050.0000 6449 904.8684 2093709 147 147 4425.0000 8244 904.8684 2158626 151 151 1088.3426 6741 904.8684 2250897 165 165 959.3624 2326 904.8684 2440028 179 179 964.6867 2386 904.8684 2511641 180 180 1253.5714 7368 904.8684 2550160 184 184 1253.5714 7162 904.8684 2625928 Elapsed real time = 2126.73 sec. (tree size = 3.35 MB, solutions = 0) 188 188 1253.5714 7130 904.8684 2685567 190 190 5475.0000 7687 904.8684 2737320 194 194 1189.6552 6751 904.8684 2790476 198 198 6000.0000 8124 904.8684 2831810 262 256 1077.0048 2374 904.8684 3184739 * 264+ 256 15900.0000 904.8684 3184793 94.31% Implied bound cuts applied: 3 Mixed integer rounding cuts applied: 151 Zero-half cuts applied: 6 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 256.57 Parallel b&c, 4 threads: Real time = 1989.47 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 2246.04 sec. Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 1.5900000000e+04 Current MIP best bound = 9.0486836910e+02 (gap = 14995.1, 94.31%) Solution time = 2246.51 sec. Iterations = 3184793 Nodes = 264 (257) Deterministic time = 1444954.60 ticks (643.20 ticks/sec) CPLEX> 6960.20user 2.94system 37:26.59elapsed 309%CPU (0avgtext+0avgdata 1078768maxresident)k 0inputs+776outputs (0major+1743692minor)pagefaults 0swaps