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: R143617 Selected RHS name: B Selected bound name: BOUND Problem 'in_i.mps.gz' read. Read time = 0.36 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 1 time. MIP Presolve eliminated 1 rows and 1 columns. MIP Presolve modified 15153 coefficients. Reduced MIP has 143615 rows, 135753 columns, and 849767 nonzeros. Reduced MIP has 135635 binaries, 118 generals, 0 SOSs, and 0 indicators. Probing fixed 18 vars, tightened 0 bounds. Probing time = 0.16 sec. Tried aggregator 1 time. MIP Presolve eliminated 18 rows and 18 columns. MIP Presolve modified 173734 coefficients. Reduced MIP has 143359 rows, 135735 columns, and 758987 nonzeros. Reduced MIP has 135617 binaries, 118 generals, 0 SOSs, and 0 indicators. Presolve time = 2.39 sec. Probing time = 0.08 sec. Clique table members: 103742. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 27.79 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 122000.0000 15345 122000.0000 12 Heuristic still looking. 0 2 122000.0000 15345 122000.0000 12 Elapsed real time = 752.07 sec. (tree size = 0.01 MB, solutions = 0) 1 3 126949.5092 16252 122000.0000 418779 Root node processing (before b&c): Real time = 749.52 Parallel b&c, 4 threads: Real time = 2848.12 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 3597.64 sec. MIP - Time limit exceeded, no integer solution. Current MIP best bound = 1.2200000000e+05 (gap is infinite) Solution time = 3600.04 sec. Iterations = 444576 Nodes = 2 (3) Deterministic time = 1816561.93 ticks (504.60 ticks/sec) CPLEX> 4331.66user 1.03system 1:00:00elapsed 120%CPU (0avgtext+0avgdata 3325136maxresident)k 0inputs+112outputs (0major+819806minor)pagefaults 0swaps