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_i.mps' read. Read time = 0.02 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 2 times. MIP Presolve eliminated 4227 rows and 2374 columns. MIP Presolve modified 95 coefficients. Aggregator did 1327 substitutions. Reduced MIP has 2664 rows, 5965 columns, and 27820 nonzeros. Presolve time = 0.07 sec. Clique table members: 2057. MIP emphasis: integer feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 2.28 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 12.3844 945 12.3844 8809 0 0 13.0000 673 Cuts: 472 18293 0 0 13.0000 617 Cuts: 45 24791 0 0 13.0000 709 Cuts: 36 35572 0 2 13.0000 709 13.0000 35572 Elapsed time = 11.59 sec. (tree size = 0.01 MB, solutions = 0) 100 94 15.0000 453 13.0000 256789 200 182 14.0000 555 13.0000 656470 300 250 infeasible 13.0000 898326 400 321 15.0000 437 13.0000 1404398 500 402 15.2449 431 13.0000 1611802 600 448 13.0171 665 13.0000 1812316 700 486 16.0000 341 13.0000 2114504 800 475 17.0000 136 13.0000 2370654 900 503 infeasible 13.0000 2557909 1000 525 17.0000 499 13.0000 2909043 Elapsed time = 989.47 sec. (tree size = 1.06 MB, solutions = 0) 1100 551 17.4061 172 13.0000 3526588 1200 543 14.0000 659 13.0000 3734863 1300 584 infeasible 13.0000 4331468 1400 665 14.0000 591 13.0000 4850791 * 1449+ 490 18.0000 13.0000 5043238 27.78% Clique cuts applied: 65 Implied bound cuts applied: 56 Zero-half cuts applied: 42 Gomory fractional cuts applied: 9 Solution pool: 1 solution saved. MIP - Solution limit exceeded, integer feasible: Objective = 1.8000000000e+01 Current MIP best bound = 1.3000000000e+01 (gap = 5, 27.78%) Solution time = 1719.08 sec. Iterations = 5043238 Nodes = 1449 (491) CPLEX> 1719.10user 0.10system 28:39.23elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+13000minor)pagefaults 0swaps