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: R2415 Selected RHS name: B Selected bound name: BOUND Problem 'in_i.mps.gz' read. Read time = 0.02 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 90 rows and 792 columns. MIP Presolve modified 2560 coefficients. Aggregator did 96 substitutions. Reduced MIP has 2228 rows, 5024 columns, and 18240 nonzeros. Reduced MIP has 5024 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing time = 0.00 sec. Tried aggregator 1 time. Presolve time = 0.03 sec. Probing time = 0.00 sec. Clique table members: 594. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.12 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 28.0000 482 28.0000 1770 0 0 28.0000 287 ZeroHalf: 1 1781 0 0 28.0000 450 Cuts: 79 2200 0 0 28.0000 212 ZeroHalf: 3 2214 0 0 28.0000 229 Cuts: 30 2581 0 2 28.0000 182 28.0000 2581 Elapsed real time = 3.97 sec. (tree size = 0.01 MB, solutions = 0) 9 3 28.0000 226 28.0000 5524 20 8 28.0000 253 28.0000 11751 32 14 28.0000 260 28.0000 15890 61 35 28.0000 68 28.0000 22694 77 45 28.0000 213 28.0000 29760 134 84 28.0000 208 28.0000 39791 219 125 infeasible 28.0000 51179 283 149 28.0000 72 28.0000 58070 380 184 28.0000 125 28.0000 68411 700 326 28.0000 239 28.0000 101639 Elapsed real time = 7.47 sec. (tree size = 4.49 MB, solutions = 0) 1244 438 28.0000 132 28.0000 142228 1718 522 28.0000 160 28.0000 179991 2151 584 28.0000 117 28.0000 214529 2743 656 28.0000 172 28.0000 253966 3297 716 28.0000 219 28.0000 289569 3940 755 infeasible 28.0000 337107 4383 802 28.0000 140 28.0000 370403 4763 920 infeasible 28.0000 413043 4928 961 infeasible 28.0000 448546 5154 1041 infeasible 28.0000 490417 Elapsed real time = 17.49 sec. (tree size = 16.04 MB, solutions = 0) * 5184+ 701 31.0000 28.0000 502121 9.68% Zero-half cuts applied: 37 Gomory fractional cuts applied: 17 Root node processing (before b&c): Real time = 10.06 Parallel b&c, 4 threads: Real time = 13.55 Sync time (average) = 0.01 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 23.61 sec. Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 3.1000000000e+01 Current MIP best bound = 2.8000000000e+01 (gap = 3, 9.68%) Solution time = 23.64 sec. Iterations = 502121 Nodes = 5184 (702) Deterministic time = 23091.71 ticks (976.63 ticks/sec) CPLEX> 69.30user 0.05system 0:23.67elapsed 292%CPU (0avgtext+0avgdata 403808maxresident)k 0inputs+56outputs (0major+26270minor)pagefaults 0swaps