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: obj Selected RHS name: rhs Selected bound name: bnd Problem 'in_h.mps' read. Read time = 0.07 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 86 rows and 2 columns. Aggregator did 118 substitutions. Reduced MIP has 18125 rows, 19726 columns, and 120149 nonzeros. Presolve time = 0.18 sec. Clique table members: 21054. MIP emphasis: hidden feasible solutions. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.54 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 0.0000 970 0.0000 2216 0 0 0.0000 282 Cuts: 1872 26900 0 0 0.0000 249 Cuts: 877 58898 0 0 0.0000 820 Cuts: 599 62950 0 0 0.0000 228 Cuts: 551 81913 0 0 0.0000 823 Cuts: 597 88608 0 2 0.0000 222 0.0000 88608 Elapsed time = 157.22 sec. (tree size = 0.00 MB, solutions = 0) 100 96 0.0000 83 0.0000 95271 200 153 0.0000 212 0.0000 119447 300 193 infeasible 0.0000 131238 400 237 0.0000 118 0.0000 169951 500 301 0.0000 139 0.0000 199407 600 352 0.0000 136 0.0000 334522 700 373 0.0000 106 0.0000 352228 * 725+ 1 0.0000 0.0000 354418 0.00% GUB cover cuts applied: 513 Clique cuts applied: 264 Cover cuts applied: 916 Zero-half cuts applied: 96 Gomory fractional cuts applied: 65 Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 0.0000000000e+00 Solution time = 515.35 sec. Iterations = 354418 Nodes = 725 CPLEX> 515.42user 0.25system 8:35.68elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+104115minor)pagefaults 0swaps