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: R35554 Selected RHS name: B Selected bound name: BOUND Problem 'in_i.mps.gz' read. Read time = 0.14 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 3545 rows and 3634 columns. MIP Presolve modified 403 coefficients. Aggregator did 3127 substitutions. Reduced MIP has 28881 rows, 74920 columns, and 267198 nonzeros. Reduced MIP has 74858 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing fixed 2250 vars, tightened 0 bounds. Probing time = 8.83 sec. Tried aggregator 2 times. MIP Presolve eliminated 1241 rows and 3315 columns. MIP Presolve modified 748 coefficients. Aggregator did 27 substitutions. Reduced MIP has 27613 rows, 71578 columns, and 256004 nonzeros. Reduced MIP has 71516 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 9.55 sec. Probing time = 0.13 sec. Clique table members: 365133. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 28.14 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 -38.0000 7092 -38.0000 18 0 0 -37.2500 4779 Cuts: 559 49060 0 0 -37.0000 3218 Cuts: 354 176655 0 0 -36.8889 3784 Cuts: 549 229127 0 0 -36.7316 3139 Cuts: 418 302313 0 0 -36.6667 2511 Cuts: 447 401540 0 0 -36.6667 3144 Cuts: 337 483331 0 0 -36.6667 4182 Cuts: 223 574625 Heuristic still looking. Heuristic still looking. * 0+ 0 5.0000 -36.6667 574625 833.33% Clique cuts applied: 586 Cover cuts applied: 20 Implied bound cuts applied: 23 Flow cuts applied: 2 Mixed integer rounding cuts applied: 16 Zero-half cuts applied: 430 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 2082.65 Parallel b&c, 4 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 2082.65 sec. Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 5.0000000000e+00 Current MIP best bound = -3.6666666665e+01 (gap = 41.6667, 833.33%) Solution time = 2092.20 sec. Iterations = 574625 Nodes = 0 (1) Deterministic time = 1501795.74 ticks (717.81 ticks/sec) CPLEX> 4161.29user 0.31system 34:52.37elapsed 198%CPU (0avgtext+0avgdata 1501280maxresident)k 0inputs+184outputs (0major+155535minor)pagefaults 0swaps