-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqp.log
62 lines (51 loc) · 2.39 KB
/
qp.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
Gurobi 6.0.0 (mac64) logging started Wed Jan 14 16:20:55 2015
Optimize a model with 2 rows, 3 columns and 5 nonzeros
Model has 5 quadratic objective terms
Coefficient statistics:
Matrix range [1e+00, 3e+00]
Objective range [2e+00, 2e+00]
Bounds range [1e+00, 1e+00]
RHS range [1e+00, 4e+00]
Presolve time: 0.00s
Presolved: 2 rows, 3 columns, 5 nonzeros
Presolved model has 5 quadratic objective terms
Ordering time: 0.00s
Barrier statistics:
Free vars : 2
AA' NZ : 6.000e+00
Factor NZ : 1.000e+01
Factor Ops : 3.000e+01 (less than 1 second per iteration)
Threads : 1
Objective Residual
Iter Primal Dual Primal Dual Compl Time
0 1.69015022e+05 -1.71012100e+05 1.50e+03 3.33e+02 1.00e+06 0s
1 3.60255402e+04 -3.91306233e+04 2.28e+02 3.82e+01 1.20e+05 0s
2 4.14685168e+00 -4.40925173e+03 1.80e+00 4.00e-01 1.83e+03 0s
3 2.81937163e+00 -1.92736174e+03 1.80e-06 4.00e-07 2.41e+02 0s
4 2.81628339e+00 -1.81287557e-01 8.60e-10 1.91e-10 3.75e-01 0s
5 2.26977145e+00 2.06670895e+00 6.89e-12 1.53e-12 2.54e-02 0s
6 2.11498124e+00 2.11029644e+00 0.00e+00 4.44e-16 5.86e-04 0s
7 2.11111498e+00 2.11111030e+00 0.00e+00 2.22e-16 5.85e-07 0s
8 2.11111111e+00 2.11111111e+00 1.11e-16 2.22e-16 5.86e-10 0s
Barrier solved model in 8 iterations and 0.00 seconds
Optimal objective 2.11111111e+00
Optimize a model with 2 rows, 3 columns and 5 nonzeros
Model has 5 quadratic objective terms
Coefficient statistics:
Matrix range [1e+00, 3e+00]
Objective range [2e+00, 2e+00]
Bounds range [1e+00, 1e+00]
RHS range [1e+00, 4e+00]
Found heuristic solution: objective 7
Presolve removed 1 rows and 1 columns
Presolve time: 0.00s
Presolved: 2 rows, 3 columns, 5 nonzeros
Variable types: 0 continuous, 3 integer (3 binary)
Root relaxation: objective 3.000000e+00, 1 iterations, 0.00 seconds
Nodes | Current Node | Objective Bounds | Work
Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time
* 0 0 0 3.0000000 3.00000 0.00% - 0s
Explored 0 nodes (1 simplex iterations) in 0.00 seconds
Thread count was 4 (of 8 available processors)
Optimal solution found (tolerance 1.00e-04)
Best objective 3.000000000000e+00, best bound 3.000000000000e+00, gap 0.0%