-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCPLEX_test_log.log
149 lines (136 loc) · 6.68 KB
/
CPLEX_test_log.log
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
Version identifier: 20.1.0.0 | 2020-11-10 | 9bedb6d68
CPXPARAM_Read_DataCheck 1
CPXPARAM_MIP_Tolerances_MIPGap 0.10000000000000001
Tried aggregator 2 times.
MIQP Presolve eliminated 14610 rows and 10223 columns.
MIQP Presolve modified 1462 coefficients.
Aggregator did 2190 substitutions.
Presolve time = 0.05 sec. (33.24 ticks)
Root node processing (before b&c):
Real time = 0.05 sec. (35.68 ticks)
Parallel b&c, 8 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.05 sec. (35.68 ticks)
Version identifier: 20.1.0.0 | 2020-11-10 | 9bedb6d68
CPXPARAM_Read_DataCheck 1
CPXPARAM_OptimalityTarget 3
CPXPARAM_MIP_Tolerances_MIPGap 0.10000000000000001
Tried aggregator 2 times.
MIQP Presolve eliminated 14610 rows and 10223 columns.
MIQP Presolve modified 1462 coefficients.
Aggregator did 2190 substitutions.
Reduced MIQP has 7294 rows, 6570 columns, and 16048 nonzeros.
Reduced MIQP has 1460 binaries, 0 generals, 0 SOSs, and 0 indicators.
Reduced MIQP objective Q matrix has 4380 nonzeros.
Presolve time = 0.02 sec. (34.99 ticks)
Probing time = 0.00 sec. (0.59 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 8 threads.
Root relaxation solution time = 0.05 sec. (54.40 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0 0 integral 0 1.61809e+08 1.61809e+08 10 0.00%
0 0 cutoff 1.61809e+08 1.61809e+08 10 0.00%
Elapsed time = 0.16 sec. (218.97 ticks, tree = 0.01 MB, solutions = 1)
Root node processing (before b&c):
Real time = 0.16 sec. (219.56 ticks)
Parallel b&c, 8 threads:
Real time = 0.05 sec. (4.94 ticks)
Sync time (average) = 0.00 sec.
Wait time (average) = 0.00 sec.
------------
Total (root+branch&cut) = 0.20 sec. (224.49 ticks)
Version identifier: 20.1.0.0 | 2020-11-10 | 9bedb6d68
CPXPARAM_Read_DataCheck 1
CPXPARAM_OptimalityTarget 3
CPXPARAM_MIP_Tolerances_MIPGap 0.10000000000000001
Tried aggregator 2 times.
MIQP Presolve eliminated 970 rows and 675 columns.
MIQP Presolve modified 98 coefficients.
Aggregator did 144 substitutions.
Reduced MIQP has 474 rows, 432 columns, and 1044 nonzeros.
Reduced MIQP has 96 binaries, 0 generals, 0 SOSs, and 0 indicators.
Reduced MIQP objective Q matrix has 288 nonzeros.
Presolve time = 0.00 sec. (2.25 ticks)
Probing time = 0.00 sec. (0.07 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 8 threads.
Root relaxation solution time = 0.00 sec. (3.06 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0 0 integral 0 1.02111e+07 1.02111e+07 9 0.00%
0 0 cutoff 1.02111e+07 1.02111e+07 9 0.00%
Elapsed time = 0.02 sec. (10.34 ticks, tree = 0.01 MB, solutions = 1)
Root node processing (before b&c):
Real time = 0.02 sec. (10.38 ticks)
Parallel b&c, 8 threads:
Real time = 0.02 sec. (0.32 ticks)
Sync time (average) = 0.00 sec.
Wait time (average) = 0.00 sec.
------------
Total (root+branch&cut) = 0.03 sec. (10.70 ticks)
Version identifier: 20.1.0.0 | 2020-11-10 | 9bedb6d68
CPXPARAM_Read_DataCheck 1
CPXPARAM_OptimalityTarget 3
CPXPARAM_MIP_Tolerances_MIPGap 0.10000000000000001
Tried aggregator 2 times.
MIQP Presolve eliminated 968 rows and 673 columns.
MIQP Presolve modified 96 coefficients.
Aggregator did 146 substitutions.
Reduced MIQP has 474 rows, 432 columns, and 1044 nonzeros.
Reduced MIQP has 96 binaries, 0 generals, 0 SOSs, and 0 indicators.
Reduced MIQP objective Q matrix has 288 nonzeros.
Presolve time = 0.00 sec. (2.27 ticks)
Probing time = 0.00 sec. (0.07 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 8 threads.
Root relaxation solution time = 0.02 sec. (3.20 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0 0 integral 0 1.03965e+07 1.03965e+07 10 0.00%
0 0 cutoff 1.03965e+07 1.03965e+07 10 0.00%
Elapsed time = 0.02 sec. (10.24 ticks, tree = 0.01 MB, solutions = 1)
Root node processing (before b&c):
Real time = 0.02 sec. (10.27 ticks)
Parallel b&c, 8 threads:
Real time = 0.00 sec. (0.18 ticks)
Sync time (average) = 0.00 sec.
Wait time (average) = 0.00 sec.
------------
Total (root+branch&cut) = 0.02 sec. (10.45 ticks)
Version identifier: 20.1.0.0 | 2020-11-10 | 9bedb6d68
CPXPARAM_Read_DataCheck 1
CPXPARAM_OptimalityTarget 3
CPXPARAM_MIP_Tolerances_MIPGap 0.10000000000000001
Tried aggregator 2 times.
MIQP Presolve eliminated 488 rows and 337 columns.
MIQP Presolve modified 48 coefficients.
Aggregator did 74 substitutions.
Reduced MIQP has 234 rows, 216 columns, and 516 nonzeros.
Reduced MIQP has 48 binaries, 0 generals, 0 SOSs, and 0 indicators.
Reduced MIQP objective Q matrix has 144 nonzeros.
Presolve time = 0.00 sec. (1.11 ticks)
Probing time = 0.00 sec. (0.04 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 8 threads.
Root relaxation solution time = 0.00 sec. (1.55 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0 0 integral 0 5197870.8773 5197870.8773 10 0.00%
0 0 cutoff 5197870.8773 5197870.8773 10 0.00%
Elapsed time = 0.00 sec. (5.02 ticks, tree = 0.01 MB, solutions = 1)
Root node processing (before b&c):
Real time = 0.00 sec. (5.04 ticks)
Parallel b&c, 8 threads:
Real time = 0.00 sec. (0.16 ticks)
Sync time (average) = 0.00 sec.
Wait time (average) = 0.00 sec.
------------
Total (root+branch&cut) = 0.00 sec. (5.20 ticks)