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.27 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 4 times. MIP Presolve eliminated 15 rows and 4598 columns. Aggregator did 905 substitutions. Reduced MIP has 14019 rows, 22937 columns, and 485945 nonzeros. Reduced MIP has 16762 binaries, 6175 generals, 0 SOSs, and 0 indicators. Probing time = 0.02 sec. Tried aggregator 1 time. Presolve time = 0.71 sec. Probing time = 0.03 sec. Clique table members: 16845. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 38.93 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 13.5117 5434 13.5117 21 0 0 13.5237 3510 Cuts: 7 68083 0 0 13.5240 3112 Fract: 2 95066 0 0 13.5240 2932 ZeroHalf: 2 97698 0 0 13.5240 3038 ZeroHalf: 5 99964 0 0 13.5240 2698 ZeroHalf: 3 114142 0 0 13.5240 2688 ZeroHalf: 2 116059 * 0+ 0 13.5311 13.5240 116059 0.05% GUB cover cuts applied: 1 Mixed integer rounding cuts applied: 1 Zero-half cuts applied: 7 Gomory fractional cuts applied: 3 Root node processing (before b&c): Real time = 340.72 Parallel b&c, 4 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 340.72 sec. Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 1.3531100000e+01 Current MIP best bound = 1.3523983333e+01 (gap = 0.00711667, 0.05%) Solution time = 341.43 sec. Iterations = 116059 Nodes = 0 (1) Deterministic time = 261960.57 ticks (767.24 ticks/sec) CPLEX> 679.24user 0.16system 5:41.72elapsed 198%CPU (0avgtext+0avgdata 1021568maxresident)k 0inputs+120outputs (0major+114020minor)pagefaults 0swaps