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 2 times. MIP Presolve eliminated 7520 rows and 5023 columns. MIP Presolve modified 17 coefficients. Aggregator did 3156 substitutions. Reduced MIP has 6118 rows, 19099 columns, and 86819 nonzeros. Presolve time = 0.26 sec. Clique table members: 4643. MIP emphasis: hidden feasible solutions. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 11.97 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 6.0814 1275 6.0814 16874 0 0 7.0678 1000 Cuts: 466 34430 0 0 7.1395 1012 Cuts: 35 37511 0 0 7.2093 1040 Cuts: 38 40589 0 0 7.2457 1061 Cuts: 32 43018 0 0 7.2594 1043 Cuts: 12 44168 0 0 7.2893 1065 Cuts: 12 45741 0 0 7.3072 1022 Cuts: 22 46969 0 0 7.3233 1044 Cuts: 12 48364 0 0 7.3374 1046 Cuts: 12 49822 0 0 7.3462 973 Cuts: 15 50685 0 0 7.3656 1022 Cuts: 16 52311 0 0 7.3827 1032 Cuts: 11 53816 0 0 7.3922 1023 Cuts: 13 54818 0 0 7.3941 1013 Cuts: 5 55391 0 0 7.3952 1046 Cuts: 6 55763 0 0 7.3991 1037 Cuts: 3 56451 0 0 7.4072 1047 Cuts: 4 57350 0 0 7.4133 1050 Cuts: 14 57962 0 0 7.4146 1056 Cuts: 7 58425 0 0 7.4166 1057 Cuts: 7 58839 0 0 7.4212 1043 Cuts: 3 59480 0 0 7.4265 1079 ZeroHalf: 1 59973 0 0 7.4269 1096 Cliques: 3 60104 Heuristic still looking. Heuristic still looking. Heuristic still looking. 0 2 7.4269 1096 7.4269 60104 Elapsed time = 285.00 sec. (tree size = 0.00 MB, solutions = 0) 100 68 7.7545 801 7.4554 135906 200 146 9.0000 693 7.4575 548625 300 241 7.7227 863 7.4575 956899 400 285 7.9868 816 7.4646 1007567 500 369 9.0000 804 7.5445 1458215 600 385 10.0000 768 7.8259 2235107 700 413 9.0000 843 7.8510 2881540 800 423 infeasible 7.8518 3633649 900 465 11.0000 932 7.8755 4241782 1000 518 11.0184 652 7.8755 5072687 Elapsed time = 5723.07 sec. (tree size = 2.84 MB, solutions = 0) 1100 565 10.0000 828 7.8991 5819698 Command terminated by signal 9 7200.19user 0.25system 2:00:00elapsed 100%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+54107minor)pagefaults 0swaps