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.07 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 9762 rows and 5626 columns. MIP Presolve modified 129 coefficients. Aggregator did 2862 substitutions. Reduced MIP has 5428 rows, 13094 columns, and 57941 nonzeros. Reduced MIP has 13094 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing fixed 324 vars, tightened 0 bounds. Probing time = 0.44 sec. Tried aggregator 2 times. MIP Presolve eliminated 269 rows and 325 columns. MIP Presolve modified 20 coefficients. Aggregator did 86 substitutions. Reduced MIP has 5073 rows, 12683 columns, and 56005 nonzeros. Reduced MIP has 12683 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 0.56 sec. Probing time = 0.04 sec. Clique table members: 83425. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 1.21 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 15.0082 1140 15.0082 128 0 0 15.5890 1038 Cuts: 564 18187 0 0 15.7944 1048 Cuts: 416 27135 0 0 15.7991 1057 Cuts: 191 35898 0 0 15.8029 1110 Cuts: 168 51701 0 0 15.8147 1060 Cuts: 257 66349 0 0 15.8213 1099 Cuts: 206 73521 0 0 15.8271 1057 Cuts: 187 84182 0 0 15.8296 1094 Cuts: 228 96183 0 0 15.8313 1160 Cuts: 169 100881 0 0 15.8325 1168 Cuts: 200 112792 0 0 15.8340 1150 Cuts: 217 122814 0 0 15.8362 1127 Cuts: 207 127390 0 0 15.8363 1217 Cuts: 173 132277 Heuristic still looking. 0 2 15.8363 1060 15.8363 132277 Elapsed real time = 76.31 sec. (tree size = 0.01 MB, solutions = 0) 1 3 22.0000 827 15.8363 144575 2 4 15.9246 1039 15.8363 156967 3 5 15.9246 1036 15.9246 160059 4 6 22.0000 776 15.9246 166810 6 8 22.0000 823 15.9246 179835 8 10 22.0000 759 15.9246 183049 9 11 15.9246 1043 15.9246 190398 13 15 15.9248 1026 15.9246 217283 23 25 15.9248 1031 15.9246 240090 35 37 15.9254 999 15.9246 252376 Elapsed real time = 95.05 sec. (tree size = 0.10 MB, solutions = 0) 39 41 15.9278 975 15.9246 260164 47 49 15.9305 920 15.9246 274261 92 94 15.9353 930 15.9246 320276 100 102 15.9311 905 15.9246 343436 145 147 22.0000 823 15.9246 383866 158 160 15.9321 902 15.9246 412298 174 176 20.0000 1068 15.9246 445013 186 188 15.9322 893 15.9246 468789 328 330 15.9322 885 15.9246 617524 336 338 15.9323 892 15.9246 637757 Elapsed real time = 117.85 sec. (tree size = 1.63 MB, solutions = 0) 554 546 15.9342 909 15.9246 801513 558 550 15.9488 874 15.9246 820175 669 655 17.0000 1009 15.9246 967409 677 659 17.0000 997 15.9246 990162 693 675 17.0000 849 15.9246 1023582 718 696 22.0000 34 15.9246 1101286 * 754 699 integral 0 22.0000 15.9246 1196089 27.62% 763 704 17.0000 744 22.0000 15.9246 1231342 27.62% 768 705 15.9250 977 22.0000 15.9246 1277776 27.62% 787 720 17.0000 743 22.0000 15.9246 1342812 27.62% Elapsed real time = 134.63 sec. (tree size = 3.25 MB, solutions = 0) Clique cuts applied: 113 Implied bound cuts applied: 41 Zero-half cuts applied: 73 Gomory fractional cuts applied: 6 Root node processing (before b&c): Real time = 75.70 Parallel b&c, 4 threads: Real time = 58.38 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 134.08 sec. Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 2.2000000000e+01 Current MIP best bound = 1.5924590853e+01 (gap = 6.07541, 27.62%) Solution time = 134.64 sec. Iterations = 1359415 Nodes = 789 (59) Deterministic time = 143942.92 ticks (1069.10 ticks/sec) CPLEX> 308.29user 0.08system 2:14.72elapsed 228%CPU (0avgtext+0avgdata 544064maxresident)k 0inputs+280outputs (0major+35122minor)pagefaults 0swaps