forked from lanl-ansi/PowerModelsDistribution.jl
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathoutput.log
236 lines (215 loc) · 8.98 KB
/
output.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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:04:12, May 4, 2022
Heap usage: 150KB (peak 152KB, 836KB system)
Minimizing MIQCQP
Original problem has:
116 rows 140 cols 250 elements 4 globals
4 qrows 4 qrowelem
?900 Warning: The quadratic part of row 'R113' defines a nonconvex region. Please check your model or use Xpress-SLP
*** Search completed *** Time: 0 Nodes: 0
Problem is integer infeasible
Number of integer feasible solutions found is 0
Best bound is -1.00000E+40
Uncrunching matrix
User solution (_) dropped.
?557 Error: Integer solution is not available
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:18:23, May 4, 2022
Heap usage: 150KB (peak 152KB, 1426KB system)
Minimizing MIQCQP
Original problem has:
117 rows 140 cols 251 elements 4 globals
4 qrows 4 qrowelem
?900 Warning: The quadratic part of row 'R114' defines a nonconvex region. Please check your model or use Xpress-SLP
*** Search completed *** Time: 0 Nodes: 0
Problem is integer infeasible
Number of integer feasible solutions found is 0
Best bound is -1.00000E+40
Uncrunching matrix
User solution (_) dropped.
?557 Error: Integer solution is not available
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:19:13, May 4, 2022
Heap usage: 87KB (peak 87KB, 1742KB system)
Minimizing MILP
Original problem has:
1 rows 16 cols 1 elements 4 globals
Coefficient range original solved
Coefficients [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.56e+00, 1.56e+00]
RHS and bounds [min,max] : [ 1.00e+00, 1.00e+03] / [ 1.00e+00, 6.00e+02]
Objective [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.00e+02, 1.00e+02]
Will try to keep branch and bound tree memory usage below 14.8GB
*** Heuristic solution found: -300000000.0 Time: 0 ***
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D .0000000 300.00000
------ unbounded -------
Concurrent statistics:
Dual: 0 simplex iterations, 0.00s
Problem is dual infeasible
*** Search completed *** Time: 0 Nodes: 0
Problem is unbounded
Number of integer feasible solutions found is 1
Best integer solution found is -300000000.0
Best bound is -300000000.0
User solution (_) dropped.
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:19:30, May 4, 2022
Heap usage: 102KB (peak 104KB, 2069KB system)
Minimizing MILP
Original problem has:
7 rows 123 cols 13 elements 4 globals
Coefficient range original solved
Coefficients [min,max] : [ 1.00e+00, 1.00e+02] / [ 1.00e+00, 1.56e+00]
RHS and bounds [min,max] : [ 7.50e-03, 1.00e+03] / [ 7.50e-03, 6.00e+02]
Objective [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.00e+02, 1.00e+02]
Will try to keep branch and bound tree memory usage below 14.8GB
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D .0000000 300.00000
------ unbounded -------
Concurrent statistics:
Dual: 0 simplex iterations, 0.00s
Problem is dual infeasible
*** Search completed *** Time: 0 Nodes: 0
Problem is unbounded
Number of integer feasible solutions found is 0
Best bound is 1.00000E+40
User solution (_) dropped.
?557 Error: Integer solution is not available
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:19:49, May 4, 2022
Heap usage: 92KB (peak 92KB, 2627KB system)
Minimizing MILP
Original problem has:
1 rows 33 cols 1 elements 4 globals
Coefficient range original solved
Coefficients [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.56e+00, 1.56e+00]
RHS and bounds [min,max] : [ 1.00e+00, 1.00e+03] / [ 1.00e+00, 6.00e+02]
Objective [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.00e+02, 1.00e+02]
Will try to keep branch and bound tree memory usage below 14.8GB
*** Heuristic solution found: -300000000.0 Time: 0 ***
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D .0000000 300.00000
------ unbounded -------
Concurrent statistics:
Dual: 0 simplex iterations, 0.00s
Problem is dual infeasible
*** Search completed *** Time: 0 Nodes: 0
Problem is unbounded
Number of integer feasible solutions found is 1
Best integer solution found is -300000000.0
Best bound is -300000000.0
User solution (_) dropped.
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:19:58, May 4, 2022
Heap usage: 92KB (peak 92KB, 2635KB system)
Minimizing MILP
Original problem has:
1 rows 33 cols 1 elements 4 globals
Coefficient range original solved
Coefficients [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.56e+00, 1.56e+00]
RHS and bounds [min,max] : [ 1.00e+00, 1.00e+03] / [ 1.00e+00, 6.00e+02]
Objective [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.00e+02, 1.00e+02]
Will try to keep branch and bound tree memory usage below 14.8GB
*** Heuristic solution found: -300000000.0 Time: 0 ***
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D .0000000 300.00000
------ unbounded -------
Concurrent statistics:
Dual: 0 simplex iterations, 0.00s
Problem is dual infeasible
*** Search completed *** Time: 0 Nodes: 0
Problem is unbounded
Number of integer feasible solutions found is 1
Best integer solution found is -300000000.0
Best bound is -300000000.0
User solution (_) dropped.
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:20:06, May 4, 2022
Heap usage: 93KB (peak 94KB, 3193KB system)
Minimizing MILP
Original problem has:
7 rows 45 cols 13 elements 4 globals
Coefficient range original solved
Coefficients [min,max] : [ 1.00e+00, 1.00e+02] / [ 1.00e+00, 1.56e+00]
RHS and bounds [min,max] : [ 1.00e+00, 1.00e+03] / [ 1.00e+00, 6.00e+02]
Objective [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.00e+02, 1.00e+02]
Will try to keep branch and bound tree memory usage below 14.8GB
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D .0000000 300.00000
------ unbounded -------
Concurrent statistics:
Dual: 0 simplex iterations, 0.00s
Problem is dual infeasible
*** Search completed *** Time: 0 Nodes: 0
Problem is unbounded
Number of integer feasible solutions found is 0
Best bound is 1.00000E+40
User solution (_) dropped.
?557 Error: Integer solution is not available
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:21:28, May 4, 2022
Heap usage: 97KB (peak 98KB, 3756KB system)
Minimizing MILP
Original problem has:
1 rows 92 cols 1 elements 4 globals
Coefficient range original solved
Coefficients [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.56e+00, 1.56e+00]
RHS and bounds [min,max] : [ 1.00e+00, 1.00e+03] / [ 1.00e+00, 6.00e+02]
Objective [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.00e+02, 1.00e+02]
Will try to keep branch and bound tree memory usage below 14.8GB
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D .0000000 300.00000
------ unbounded -------
Concurrent statistics:
Dual: 0 simplex iterations, 0.00s
Problem is dual infeasible
*** Search completed *** Time: 0 Nodes: 0
Problem is unbounded
Number of integer feasible solutions found is 0
Best bound is 1.00000E+40
User solution (_) dropped.
?557 Error: Integer solution is not available
User solution (_) stored.
FICO Xpress v8.8.0, Hyper, solve started 8:21:41, May 4, 2022
Heap usage: 92KB (peak 92KB, 3490KB system)
Minimizing MILP
Original problem has:
1 rows 69 cols 1 elements 4 globals
Coefficient range original solved
Coefficients [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.56e+00, 1.56e+00]
RHS and bounds [min,max] : [ 7.50e-03, 1.00e+03] / [ 7.50e-03, 6.00e+02]
Objective [min,max] : [ 1.00e+02, 1.00e+02] / [ 1.00e+02, 1.00e+02]
Will try to keep branch and bound tree memory usage below 14.8GB
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D .0000000 300.00000
------ unbounded -------
Concurrent statistics:
Dual: 0 simplex iterations, 0.00s
Problem is dual infeasible
*** Search completed *** Time: 0 Nodes: 0
Problem is unbounded
Number of integer feasible solutions found is 0
Best bound is 1.00000E+40
User solution (_) dropped.
?557 Error: Integer solution is not available