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: R29495 Selected RHS name: B Selected bound name: BOUND Problem 'in_i.mps.gz' read. Read time = 0.25 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. Reduced MIP has 29494 rows, 153140 columns, and 611000 nonzeros. Reduced MIP has 0 binaries, 780 generals, 0 SOSs, and 0 indicators. Presolve time = 0.16 sec. Probing time = 0.00 sec. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 20.54 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 23703.9412 237 23703.9412 18 0 0 29141.9010 252 Cuts: 864 61979 0 0 31138.5820 256 Cuts: 1112 107571 0 0 31850.6772 259 Cuts: 1082 148899 * 0+ 0 46787.3333 31850.6772 160487 31.92% Mixed integer rounding cuts applied: 2309 Gomory fractional cuts applied: 11 Root node processing (before b&c): Real time = 935.85 Parallel b&c, 4 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 935.85 sec. Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 4.6787333333e+04 Current MIP best bound = 3.1850677216e+04 (gap = 14936.7, 31.92%) Solution time = 936.01 sec. Iterations = 160487 Nodes = 0 (1) Deterministic time = 676949.07 ticks (723.23 ticks/sec) CPLEX> 1864.03user 0.63system 15:36.28elapsed 199%CPU (0avgtext+0avgdata 2320160maxresident)k 0inputs+88outputs (0major+481186minor)pagefaults 0swaps