Originally posted by: M8Y7_Masood_fathi
%%%%%%%%%%CPLEX 12.5%%%%%%%%%%%%%
Tried aggregator 2 times. MIP Presolve eliminated 90 rows and 98 columns. MIP Presolve modified 10 coefficients. Aggregator did 10 substitutions. Reduced MIP has 88 rows, 150 columns, and 370 nonzeros. Reduced MIP has 0 binaries, 80 generals, 0 SOSs, and 0 indicators. Presolve time = 0.01 sec. (0.40 ticks) Found incumbent of value 8006425.000000 after 0.01 sec. (0.76 ticks) Probing time = 0.00 sec. (0.00 ticks) Tried aggregator 2 times. MIP Presolve eliminated 1 rows and 3 columns. Aggregator did 9 substitutions. Reduced MIP has 78 rows, 138 columns, and 337 nonzeros. Reduced MIP has 1 binaries, 76 generals, 0 SOSs, and 0 indicators. Presolve time = 0.00 sec. (0.18 ticks) Probing time = 0.00 sec. (0.00 ticks) MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.00 sec. (0.14 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 8006325.0000 8001375.0000 0 0.06% * 0+ 0 8004575.0000 8001375.0000 0 0.04% * 0 0 integral 0 8001375.0000 8001375.0000 0 0.00% Elapsed time = 0.01 sec. (1.21 ticks, tree = 0.00 MB, solutions = 3) Root node processing (before b&c): Real time = 0.00 sec. (0.26 ticks) Parallel b&c, 4 threads: Real time = 0.00 sec. (0.00 ticks) Sync time (average) = 0.00 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 0.00 sec. (0.26 ticks) Time = 0.1878 Objective function 8001375 N_Tours 8 Inventory 0.3438
Tried aggregator 2 times. MIP Presolve eliminated 90 rows and 98 columns. MIP Presolve modified 10 coefficients. Aggregator did 10 substitutions. Reduced MIP has 88 rows, 150 columns, and 370 nonzeros. Reduced MIP has 0 binaries, 80 generals, 0 SOSs, and 0 indicators. Probing fixed 0 vars, tightened 2 bounds. Probing time = 0.00 sec. Tried aggregator 2 times. MIP Presolve eliminated 1 rows and 3 columns. Aggregator did 9 substitutions. Reduced MIP has 78 rows, 138 columns, and 337 nonzeros. Reduced MIP has 1 binaries, 76 generals, 0 SOSs, and 0 indicators. Presolve time = 0.00 sec. Probing time = 0.00 sec. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.00 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 8000256.2500 59 8000256.2500 0 * 0+ 0 8002275.0000 8000256.2500 0 0.03% 0 0 8000844.3974 33 8002275.0000 Cuts: 119 47 0.02% * 0+ 0 8001875.0000 8000844.3974 47 0.01% 0 0 8001126.1200 22 8001875.0000 Cuts: 110 73 0.01% Mixed integer rounding cuts applied: 91 Zero-half cuts applied: 1 Gomory fractional cuts applied: 49 Root node processing (before b&c): Real time = 0.02 Sequential b&c: Real time = 0.00 ------- Total (root+branch&cut) = 0.02 sec. Time = 0.1744 Objective function 8001875 N_Tours 8 Inventory 0.4688
#CPLEXOptimizers#DecisionOptimization