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: R0957 Selected RHS name: B Selected bound name: BOUND Problem 'in_i.mps' read. Read time = 0.00 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: 1 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 0 rows and 2 columns. MIP Presolve modified 326 coefficients. Reduced MIP has 956 rows, 1274 columns, and 5956 nonzeros. Presolve time = 0.00 sec. Clique table members: 416. MIP emphasis: integer feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.01 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 34018.4212 50 34018.4212 523 0 0 34381.4844 49 Cuts: 184 860 0 0 34459.4397 59 Cuts: 94 994 0 0 34497.3488 53 Cuts: 104 1070 0 2 34497.3488 53 34497.3488 1070 100 71 35014.4617 20 34503.7399 3627 200 151 34945.3986 26 34503.7399 6444 300 219 37426.4334 22 34503.7399 9771 400 286 35225.2292 15 34522.8927 12347 500 356 35259.8330 60 35194.7979 16436 600 205 37209.3133 47 35274.6157 18713 * 667+ 140 38095.0900 35291.1214 20044 7.36% Clique cuts applied: 4 Cover cuts applied: 102 Implied bound cuts applied: 18 Flow cuts applied: 19 Mixed integer rounding cuts applied: 15 Gomory fractional cuts applied: 18 Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 3.8095090000e+04 Current MIP best bound = 3.5291121383e+04 (gap = 2803.97, 7.36%) Solution time = 1.33 sec. Iterations = 20044 Nodes = 667 (141) CPLEX> 1.34user 0.01system 0:01.36elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+3045minor)pagefaults 0swaps