ILOG CPLEX 11.110, licensed to "arizona-tempe, az", options: e m b q p=8 Welcome to CPLEX Interactive Optimizer 11.1.1 with Simplex, Mixed Integer & Barrier Optimizers Copyright (c) ILOG 1997-2008 CPLEX is a registered trademark of ILOG 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: cost Selected RHS name: rhs Selected bound name: bnd Problem 'in_h.mps' read. Read time = 0.16 sec. CPLEX> Available emphasis parameters: memory set reduced memory emphasis mip set emphasis for MIP optimization numerical set extreme numerical caution emphasis Emphasis parameter to set: Present value for emphasis for MIP optimization: 0 0 = balance optimality and integer feasibility 1 = integer feasibility 2 = optimality 3 = moving best bound 4 = finding hidden feasible solutions New value for emphasis for MIP optimization: New value for emphasis for MIP optimization: 4 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 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 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: 2100000000 New value for mixed integer solutions limit: New value for mixed integer solutions limit: 1 CPLEX> Available Parameters: advance set indicator for advanced starting information barrier set parameters for barrier optimization clocktype set type of clock used to measure time conflict set parameters for finding conflicts defaults set all parameter values to defaults emphasis set optimization emphasis feasopt set parameters for feasopt logfile set file to which results are printed lpmethod set method for linear optimization mip set parameters for mixed integer optimization network set parameters for network optimizations output set extent and destinations of outputs parallel set parallel optimization mode preprocessing set parameters for preprocessing qpmethod set method for quadratic optimization read set problem read parameters sifting set parameters for sifting optimization simplex set parameters for primal and dual simplex optimizations threads set default parallel thread count timelimit set time limit in seconds tune set parameters for parameter tuning workdir set directory for working files workmem set memory available for working storage (in megabytes) Parameter to set: Present value for default parallel thread count: 0 0 = automatic 1 = sequential >1 parallel New value for default parallel thread count: New value for default parallel thread count: 1 CPLEX> Tried aggregator 1 time. MIP Presolve eliminated 5119 rows and 424 columns. MIP Presolve modified 8251 coefficients. Aggregator did 2 substitutions. Reduced MIP has 19116 rows, 3306 columns, and 190306 nonzeros. Presolve time = 0.38 sec. Clique table members: 4606. MIP emphasis: hidden feasible solutions. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 1.29 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 7225.6443 598 7225.6443 15337 0 0 9278.4254 300 Cuts: 245 17266 0 0 10029.3899 332 Cuts: 23 18344 0 0 10029.8567 330 Cuts: 28 18741 0 0 10063.5582 342 Cuts: 11 19209 0 0 10063.6752 305 Cuts: 11 19395 0 0 10063.7072 312 Cuts: 18 19474 0 0 10063.8471 330 Cuts: 31 19929 Heuristic still looking. Heuristic still looking. 0 2 10063.8471 330 10063.8471 19929 Elapsed time = 52.39 sec. (tree size = 0.00 MB, solutions = 0) 100 86 16914.5880 94 10696.9880 115315 200 186 16920.1829 48 10696.9880 119048 300 276 12330.3454 171 10696.9880 133609 400 352 infeasible 10697.0245 200888 500 420 10813.0527 231 10697.0660 340173 600 344 17917.2600 148 10698.1899 547804 700 345 18568.9046 232 10708.1423 700469 800 381 12358.8935 289 10708.2426 820981 900 400 infeasible 10708.9358 1008709 1000 435 12226.4768 255 10709.4937 1171356 Elapsed time = 3404.42 sec. (tree size = 1.23 MB, solutions = 0) * 1054+ 398 18422.1238 10709.4937 1209026 41.87% GUB cover cuts applied: 4 Clique cuts applied: 25 Cover cuts applied: 8 Implied bound cuts applied: 18 Mixed integer rounding cuts applied: 3 Zero-half cuts applied: 16 Gomory fractional cuts applied: 3 Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 1.8422123778e+04 Current MIP best bound = 1.0709493702e+04 (gap = 7712.63, 41.87%) Solution time = 3488.36 sec. Iterations = 1209026 Nodes = 1054 (399) CPLEX> 3488.50user 0.26system 58:08.86elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+83632minor)pagefaults 0swaps