Originally posted by: SystemAdmin
[a_shraideh said:]
Hello every body,
i use cplex9 with java to solve linear Integer problem
can somebody explain for me the out put of cplex please
ried aggregator 1 time.
No MIP presolve or aggregator reductions.
Presolve time = 0.02 sec.
Clique table members: 89
MIP emphasis: balance optimality and feasibility
Root relaxation solution time = 0.02 sec.
Nodes Cuts/
Node Left Objective IInf Best Integer Best Node ItCnt Gap Variable B Parent Depth
0 0 87.5000 161 87.5000 428
* 0+ 0 0 96.0000 87.5000 428 8.85%
87.5000 92 96.0000 Cuts: 247 693 8.85%
87.5000 70 96.0000 Cuts: 124 938 8.85%
87.5000 48 96.0000 Cuts: 33 1039 8.85%
87.5000 58 96.0000 MIRcuts: 24 1208 8.85%
* 0+ 0 0 95.0000 87.5000 1208 7.89%
* 0+ 0 0 94.0000 87.5000 1208 6.91%
* 0+ 0 0 92.0000 87.5000 1208 4.89%
* 0+ 0 0 90.0000 87.5000 1208 2.78%
* 0+ 0 0 89.0000 87.5000 1208 1.69%
100 100 87.5000 49 89.0000 87.5000 4943 1.69% D 98 64
200 200 87.5000 59 89.0000 87.5000 10838 1.69% U 199 129
300 300 87.5000 62 89.0000 87.5000 16000 1.69% U 299 198
400 400 87.5000 51 89.0000 87.5000 18686 1.69% D 397 268
500 500 87.5000 54 89.0000 87.5000 21672 1.69% D 499 331
600 600 87.5143 54 89.0000 87.5000 24523 1.69% U 599 393
700 700 87.5286 41 89.0000 87.5000 28420 1.69% D 698 457
800 800 87.5571 32 89.0000 87.5000 32229 1.69% U 799 518
900 900 87.6000 20 89.0000 87.5000 35478 1.69% U 899 580
* 970+ 2 0 88.0000 87.5000 37399 0.57%
Implied bound cuts applied: 18
Flow cuts applied: 2
Mixed integer rounding cuts applied: 75
Gomory fractional cuts applied: 24
especially the first line
Nodes Cuts/
Node Left Objective IInf Best Integer Best Node ItCnt Gap Variable B Parent Depth
#DecisionOptimization#MathematicalProgramming-General