Originally posted by: SystemAdmin
Hi Abishek,
Normally how do I can get the conflict.clp file form the models.I think that would be easy to compile the code.
Other than that what is the meaning of these things.Do you have clear document to read stuffs in Engine log.
Tried aggregator 5 times.
MIP Presolve eliminated 67 rows and 28 columns.
MIP Presolve modified 28 coefficients.
Aggregator did 25 substitutions.
Reduced MIP has 25 rows, 23 columns, and 65 nonzeros.
Reduced MIP has 23 binaries, 0 generals, 0 SOSs, and 0 indicators.
Probing time = 0.00 sec.
Tried aggregator 1 time.
Presolve time = 0.08 sec.
Found feasible solution after 0.12 sec. Objective = 0.0000
Probing time = 0.00 sec.
Clique table members: 101.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 4 threads.
Root relaxation solution time = 0.02 sec.
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
-
0+ 0 0.0000 14 ---
-
0+ 0 284.0000 14 ---
0 0 338.5357 17 284.0000 338.5357 14 19.20%
-
0+ 0 293.0000 338.5357 14 15.54%
0 0 cutoff 293.0000 20 0.00%
Elapsed real time = 1.28 sec. (tree size = 0.00 MB, solutions = 3)
Clique cuts applied: 35
Cover cuts applied: 1
Implied bound cuts applied: 1
Zero-half cuts applied: 8
Gomory fractional cuts applied: 1
Root node processing (before b&c):
Real time = 1.58
Parallel b&c, 4 threads:
Real time = 0.00
Sync time (average) = 0.00
Wait time (average) = 0.00
Total (root+branch&cut) = 1.58 sec.
#DecisionOptimization#MathematicalProgramming-General