Skip to content

Instantly share code, notes, and snippets.

@dpo

dpo/a.rb

Created July 1, 2014 21:41
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save dpo/613b647c5a50a009a96d to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save dpo/613b647c5a50a009a96d to your computer and use it in GitHub Desktop.
Download ZIP
Raw
a.rb
creating unitTest
./unitTest -miplib3Dir= -mpsDir=`echo /private/tmp/symphony-N9Ul/SYMPHONY-5.5.7/Data/Sample`
Now testing the OsiRowCut class with OsiSymSolverInterface
Coin0008I EXAMPLE read with 0 errors
Coin0008I EXAMPLE read with 0 errors
Coin0008I EXAMPLE read with 0 errors
Now testing the OsiColCut class with OsiSymSolverInterface
Coin0008I EXAMPLE read with 0 errors
Coin0008I EXAMPLE read with 0 errors
Coin0008I EXAMPLE read with 0 errors
Now testing the OsiRowCutDebugger class with OsiSymSolverInterface
Coin0008I EXAMPLE read with 0 errors
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Solving...
****************************************************
* Optimal Solution Found *
****************************************************
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
Cut with 3 coefficients, cuts off known solutions by 3.5, lo=-1.79769e+308, ub=5
( 0 , 1 ) ( 2 , 5 ) ( 3 , 1 )
Non zero solution values are
( 0 , 2.5 ) ( 2 , 1 ) ( 3 , 1 )
Cut 1 with 3 coefficients, cuts off known solution by 3.5, lo=-1.79769e+308, ub=5
( 0 , 1 ) ( 2 , 5 ) ( 3 , 1 )
Non zero solution values are
( 0 , 2.5 ) ( 2 , 1 ) ( 3 , 1 )
Now testing OsiSymSolverInterface
Coin0008I EXAMPLE read with 0 errors
sym: running common unit tests.
Testing empty solver interface ...
Coin0008I EXAMPLE read with 0 errors
Testing row/column name handling ...*** symSolverInterface testing issue: testNames: switch to lazy names failed: si->setIntParam(OsiNameDiscipline, 1) == true
Coin0008I EXAMPLE read with 0 errors
Testing functionality related to the objective.
Coin0008I E226 read with 0 errors
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
223 constraints
282 variables
2578 nonzero coefficients
Total Presolve Time: 0.000243...
Solving...
solving root lp relaxation
The LP value is: -11.639 [0,283]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.007
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.007
Total Wallclock Time 0.008
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: -11.6389290664
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 0.198
1 0.095
2 0.043
4 0.214
7 5.805
8 0.077
10 0.012
16 0.049
17 0.399
19 0.394
21 10.609
22 0.159
23 3.966
24 1.964
25 0.960
26 2.908
27 1.786
28 0.102
29 0.605
30 1.265
32 10.951
34 0.053
36 0.135
37 0.421
38 0.666
40 0.051
42 0.084
46 0.043
48 0.063
50 0.181
53 0.194
54 1.664
56 0.634
57 0.287
58 1.664
59 0.114
61 0.033
63 0.012
65 0.022
66 0.096
67 0.487
68 0.197
69 0.094
70 0.510
71 1.397
72 0.138
74 33.730
75 17.926
76 0.037
77 1.072
78 3.825
79 0.106
80 0.483
81 11.891
82 24.141
83 73.579
84 0.989
86 0.013
90 0.115
92 0.066
93 0.012
94 0.193
95 8.931
96 11.593
97 32.505
98 6.161
99 103.359
100 4.465
101 15.501
102 68.960
108 0.231
111 3.692
112 0.347
114 0.316
124 0.184
125 0.217
126 0.006
128 0.049
129 0.527
134 0.296
141 0.512
142 0.039
150 0.486
152 0.046
153 0.665
154 0.058
155 0.493
157 0.625
158 0.038
163 0.592
164 1.269
165 1.293
166 0.399
173 1.332
181 0.159
182 0.011
185 0.011
186 0.152
187 0.325
189 0.889
191 0.292
192 1.214
193 0.097
200 0.189
204 0.049
209 0.095
210 0.252
211 0.267
215 0.109
219 0.198
222 0.017
227 0.901
231 0.690
234 1.061
241 1.254
250 3.033
251 1.218
252 0.509
255 2.736
258 1.587
259 0.529
261 2.264
267 0.629
270 4.284
274 0.456
277 0.441
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
223 constraints
282 variables
2578 nonzero coefficients
Total Presolve Time: 0.000183...
Solving...
solving root lp relaxation
The LP value is: 111.651 [0,118]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.003
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.003
Total Wallclock Time 0.003
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 111.6509606896
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
7 6.050
10 0.043
12 1.812
14 22.640
18 8.588
19 0.431
20 2.489
21 7.809
23 4.252
27 2.952
31 2.489
45 0.104
58 5.537
60 4.075
78 3.825
81 2.582
82 5.609
83 184.940
95 9.308
96 25.975
97 17.396
99 213.798
100 4.654
101 21.944
102 207.764
105 0.622
107 2.433
108 0.231
109 0.068
111 4.385
126 0.117
131 0.451
136 0.676
138 0.894
145 0.858
151 0.481
153 0.704
156 0.676
162 0.036
163 0.310
164 1.005
165 3.661
168 2.140
183 3.598
184 6.244
185 0.069
191 2.853
193 0.741
200 0.620
205 0.228
209 0.167
211 1.554
215 0.109
216 0.541
219 0.048
222 1.269
228 1.347
231 0.690
238 0.243
246 4.355
257 0.946
264 3.151
274 5.216
275 5.354
280 3.950
*** symSolverInterface testing issue: testObjFunctions: primal objective limit failed: si->isPrimalObjectiveLimitReached()
*** symSolverInterface testing issue: testObjFunctions: dual objective limit failed: si->isDualObjectiveLimitReached()
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
223 constraints
282 variables
2578 nonzero coefficients
Total Presolve Time: 0.000179...
Solving...
solving root lp relaxation
The LP value is: -11.639 [0,283]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.007
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.007
Total Wallclock Time 0.007
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: -11.6389290664
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 0.198
1 0.095
2 0.043
4 0.214
7 5.805
8 0.077
10 0.012
16 0.049
17 0.399
19 0.394
21 10.609
22 0.159
23 3.966
24 1.964
25 0.960
26 2.908
27 1.786
28 0.102
29 0.605
30 1.265
32 10.951
34 0.053
36 0.135
37 0.421
38 0.666
40 0.051
42 0.084
46 0.043
48 0.063
50 0.181
53 0.194
54 1.664
56 0.634
57 0.287
58 1.664
59 0.114
61 0.033
63 0.012
65 0.022
66 0.096
67 0.487
68 0.197
69 0.094
70 0.510
71 1.397
72 0.138
74 33.730
75 17.926
76 0.037
77 1.072
78 3.825
79 0.106
80 0.483
81 11.891
82 24.141
83 73.579
84 0.989
86 0.013
90 0.115
92 0.066
93 0.012
94 0.193
95 8.931
96 11.593
97 32.505
98 6.161
99 103.359
100 4.465
101 15.501
102 68.960
108 0.231
111 3.692
112 0.347
114 0.316
124 0.184
125 0.217
126 0.006
128 0.049
129 0.527
134 0.296
141 0.512
142 0.039
150 0.486
152 0.046
153 0.665
154 0.058
155 0.493
157 0.625
158 0.038
163 0.592
164 1.269
165 1.293
166 0.399
173 1.332
181 0.159
182 0.011
185 0.011
186 0.152
187 0.325
189 0.889
191 0.292
192 1.214
193 0.097
200 0.189
204 0.049
209 0.095
210 0.252
211 0.267
215 0.109
219 0.198
222 0.017
227 0.901
231 0.690
234 1.061
241 1.254
250 3.033
251 1.218
252 0.509
255 2.736
258 1.587
259 0.529
261 2.264
267 0.629
270 4.284
274 0.456
277 0.441
*** symSolverInterface testing issue: testObjFunctions: primal objective limit failed: si->isPrimalObjectiveLimitReached()
*** symSolverInterface testing issue: testObjFunctions: dual objective limit failed: si->isDualObjectiveLimitReached()
Coin0008I E226 read with 0 errors
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
223 constraints
282 variables
2578 nonzero coefficients
Total Presolve Time: 0.000174...
Solving...
solving root lp relaxation
The LP value is: 111.651 [0,118]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.003
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.003
Total Wallclock Time 0.003
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 111.6509606896
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
7 6.050
10 0.043
12 1.812
14 22.640
18 8.588
19 0.431
20 2.489
21 7.809
23 4.252
27 2.952
31 2.489
45 0.104
58 5.537
60 4.075
78 3.825
81 2.582
82 5.609
83 184.940
95 9.308
96 25.975
97 17.396
99 213.798
100 4.654
101 21.944
102 207.764
105 0.622
107 2.433
108 0.231
109 0.068
111 4.385
126 0.117
131 0.451
136 0.676
138 0.894
145 0.858
151 0.481
153 0.704
156 0.676
162 0.036
163 0.310
164 1.005
165 3.661
168 2.140
183 3.598
184 6.244
185 0.069
191 2.853
193 0.741
200 0.620
205 0.228
209 0.167
211 1.554
215 0.109
216 0.541
219 0.048
222 1.269
228 1.347
231 0.690
238 0.243
246 4.355
257 0.946
264 3.151
274 5.216
275 5.354
280 3.950
Checking that solver can set row and column solutions ...sym_get_col_solution(): Stored solution may not be feasible!
sym_get_col_solution(): Stored solution may not be feasible!
cbar<0> = 0, expecting -17.1, |error| = 17.1.
cbar<1> = 0, expecting -0.5, |error| = 0.5.
cbar<2> = 0, expecting -2.05, |error| = 2.05.
cbar<3> = 0, expecting -8, |error| = 8.
cbar<4> = 0, expecting -2, |error| = 2.
cbar<5> = 0, expecting -1.5, |error| = 1.5.
cbar<6> = 0, expecting 3, |error| = -3.
cbar<7> = 0, expecting -8.15, |error| = 8.15.
*** symSolverInterface testing issue: setting solutions: reduced costs from solution set with setRowPrice failed: ok == true
sym_get_col_solution(): Stored solution may not be feasible!
*** symSolverInterface testing issue: Errors handling imposed column/row solutions.
Coin0008I EXAMPLE read with 0 errors
sym_get_col_solution(): Stored solution may not be feasible!
sym_get_col_solution(): Stored solution may not be feasible!
sym_get_col_solution(): Stored solution may not be feasible!
sym_get_col_solution(): Stored solution may not be feasible!
sym_get_col_solution(): Stored solution may not be feasible!
sym_get_col_solution(): Stored solution may not be feasible!
Testing loadProblem and assignProblem methods.
Starting Preprocessing...
Preprocessing finished...
bounds improved: 5
constraints removed: 2
variables fixed: 1
Problem has
3 constraints
7 variables
7 nonzero coefficients
Total Presolve Time: 0.000084...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,0]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.002
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
Lower Bound in Root: 3.237
======================= LP Solver =========================
Number of times LP solver called: 2
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 0
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00 1 1
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 2 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 3
Added to LPs: 2
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 1
In root: 3
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00 1 1 1
Knapsack 0.00 1 0 0
Clique 0.00 1 0 0
Probing 0.00 1 1 1
Flowcover 0.00 1 0 0
Twomir 0.00 1 1 1
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 1.000
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000059...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000041...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000055...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.001
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000047...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000041...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000040...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000040...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
5 constraints
8 variables
14 nonzero coefficients
Total Presolve Time: 0.000039...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 0.643
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
2 constraints
3 variables
6 nonzero coefficients
Total Presolve Time: 0.000044...
Solving...
solving root lp relaxation
The LP value is: 2.000 [0,2]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 2.0000000000
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 0.182
1 0.182
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
4 constraints
3 variables
12 nonzero coefficients
Total Presolve Time: 0.000041...
Solving...
solving root lp relaxation
The LP value is: 2.000 [0,2]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 2.0000000000
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 0.182
1 0.182
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
2 constraints
3 variables
6 nonzero coefficients
Total Presolve Time: 0.000045...
Solving...
solving root lp relaxation
The LP value is: 2.000 [0,2]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 2.0000000000
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 0.182
1 0.182
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
2 constraints
3 variables
6 nonzero coefficients
Total Presolve Time: 0.000041...
Solving...
solving root lp relaxation
The LP value is: 2.000 [0,2]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 2.0000000000
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 0.182
2 0.182
Testing writeMps and writeMpsNative.
Coin0008I EXAMPLE read with 0 errors
Starting Preprocessing...
Preprocessing finished...
bounds improved: 5
constraints removed: 2
variables fixed: 1
Problem has
3 constraints
7 variables
7 nonzero coefficients
Total Presolve Time: 0.000082...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,0]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.001
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
Lower Bound in Root: 3.237
======================= LP Solver =========================
Number of times LP solver called: 2
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 0
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00 1 1
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 2 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 3
Added to LPs: 2
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 1
In root: 3
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00 1 1 1
Knapsack 0.00 1 0 0
Clique 0.00 1 0 0
Probing 0.00 1 1 1
Flowcover 0.00 1 0 0
Twomir 0.00 1 1 1
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 1.000
4 0.500
5 4.000
7 0.263
Coin0008I BLANK read with 0 errors
Starting Preprocessing...
Preprocessing finished...
bounds improved: 5
constraints removed: 2
variables fixed: 1
Problem has
3 constraints
7 variables
7 nonzero coefficients
Total Presolve Time: 0.000072...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,0]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.001
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
Lower Bound in Root: 3.237
======================= LP Solver =========================
Number of times LP solver called: 2
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 0
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00 1 1
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 2 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 3
Added to LPs: 2
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 1
In root: 3
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00 1 1 1
Knapsack 0.00 1 0 0
Clique 0.00 1 0 0
Probing 0.00 1 1 1
Flowcover 0.00 1 0 0
Twomir 0.00 1 1 1
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 1.000
4 0.500
5 4.000
7 0.263
Coin0008I BLANK read with 0 errors
Starting Preprocessing...
Preprocessing finished...
bounds improved: 5
constraints removed: 2
variables fixed: 1
Problem has
3 constraints
7 variables
7 nonzero coefficients
Total Presolve Time: 0.000086...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,0]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.001
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
Lower Bound in Root: 3.237
======================= LP Solver =========================
Number of times LP solver called: 2
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 0
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00 1 1
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 2 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 3
Added to LPs: 2
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 1
In root: 3
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00 1 1 1
Knapsack 0.00 1 0 0
Clique 0.00 1 0 0
Probing 0.00 1 1 1
Flowcover 0.00 1 0 0
Twomir 0.00 1 1 1
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 1.000
4 0.500
5 4.000
7 0.263
Testing writeLp and writeLpNative.
Coin0008I EXAMPLE read with 0 errors
Starting Preprocessing...
Preprocessing finished...
bounds improved: 5
constraints removed: 2
variables fixed: 1
Problem has
3 constraints
7 variables
7 nonzero coefficients
Total Presolve Time: 0.000086...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,0]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.001
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
Lower Bound in Root: 3.237
======================= LP Solver =========================
Number of times LP solver called: 2
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 0
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00 1 1
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 2 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 3
Added to LPs: 2
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 1
In root: 3
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00 1 1 1
Knapsack 0.00 1 0 0
Clique 0.00 1 0 0
Probing 0.00 1 1 1
Flowcover 0.00 1 0 0
Twomir 0.00 1 1 1
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
3 1.000
4 0.500
5 4.000
7 0.263
Starting Preprocessing...
Preprocessing finished...
bounds improved: 4
constraints removed: 6
variables fixed: 6
Problem has
1 constraints
2 variables
2 nonzero coefficients
Total Presolve Time: 0.000102...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,0]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
1 0.500
2 0.263
4 1.000
6 4.000
Starting Preprocessing...
Preprocessing finished...
bounds improved: 4
constraints removed: 6
variables fixed: 6
Problem has
1 constraints
2 variables
2 nonzero coefficients
Total Presolve Time: 0.000097...
Solving...
solving root lp relaxation
The LP value is: 3.237 [0,0]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 3.2368421053
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 2.500
1 0.500
2 0.263
4 1.000
6 4.000
sym has no OsiSimplex API.
testHintParam: hint 0 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 0 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 1 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 1 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 2 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 2 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 3 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 3 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 4 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 4 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 5 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 5 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 6 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 6 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 7 sense 1 strength 3 catched CoinError exception OsiForceDo illegal
testHintParam: hint 7 sense 0 strength 3 catched CoinError exception OsiForceDo illegal
Checked 8 hints x (true, false) at strength OsiForceDo; 16 throws.
loadProblem():The given problem is empty!
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
2 constraints
2 variables
4 nonzero coefficients
Total Presolve Time: 0.000040...
Solving...
solving root lp relaxation
The LP value is: 15.000 [0,1]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 15.0000000000
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 5.000
Starting Preprocessing...
Preprocessing finished...
with no modifications...
Problem has
2 constraints
2 variables
4 nonzero coefficients
Total Presolve Time: 0.000040...
Solving...
solving root lp relaxation
The LP value is: 7.000 [0,2]
****************************************************
* Optimal Solution Found *
* Now displaying stats and best solution found... *
****************************************************
======================= CP Timing ===========================
Cut Pool 0.000
====================== LP/CG Timing =========================
LP Solution Time 0.000
LP Setup Time 0.000
Variable Fixing 0.000
Pricing 0.000
Strong Branching 0.000
Separation 0.000
Primal Heuristics 0.000
Communication 0.000
Total User Time 0.000
Total Wallclock Time 0.000
====================== Statistics =========================
Number of created nodes : 1
Number of analyzed nodes: 1
Depth of tree: 0
Size of the tree: 1
Number of solutions found: 1
Number of solutions in pool: 1
Number of Chains: 1
Number of Diving Halts: 0
Number of cuts in cut pool: 0
======================= LP Solver =========================
Number of times LP solver called: 1
Number of calls from feasibility pump: 0
Number of calls from strong branching: 0
Number of solutions found by LP solve: 1
Number of bounds changed by strong branching: 0
Number of nodes pruned by strong branching: 0
Number of bounds changed by branching presolver: 0
Number of nodes pruned by branching presolver: 0
==================== Primal Heuristics ====================
Time #Called #Solutions
Rounding I 0.00
Rounding II 0.00
Diving 0.00
Feasibility Pump 0.00
Local Search 0.00 1 0
Restricted Search 0.00
Rins Search 0.00
Local Branching 0.00
=========================== Cuts ==========================
Accepted: 0
Added to LPs: 0
Deleted from LPs: 0
Removed because of bad coeffs: 0
Removed because of duplicacy: 0
Insufficiently violated: 0
In root: 0
Time in cut generation: 0.00
Time in checking quality and adding: 0.00
Time #Called In Root Total
Gomory 0.00
Knapsack 0.00
Clique 0.00
Probing 0.00
Flowcover 0.00
Twomir 0.00
Oddhole 0.00
Mir 0.00
Rounding 0.00
LandP-I 0.00
LandP-II 0.00
Redsplit 0.00
===========================================================
Solution Found: Node 0, Level 0
Solution Cost: 7.0000000000
+++++++++++++++++++++++++++++++++++++++++++++++++++
User indices and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
0 3.000
1 4.000
***Skipped Testing of OsiSymSolverInterface on Netlib problems, use -testOsiSolverInterface to run them.***
WARNING sym testObjFunctions: primal objective limit
si->isPrimalObjectiveLimitReached()
OsiSolverInterfaceTest.cpp:2097
WARNING sym testObjFunctions: dual objective limit
si->isDualObjectiveLimitReached()
OsiSolverInterfaceTest.cpp:2098
WARNING sym testObjFunctions: primal objective limit
si->isPrimalObjectiveLimitReached()
OsiSolverInterfaceTest.cpp:2097
WARNING sym testObjFunctions: dual objective limit
si->isDualObjectiveLimitReached()
OsiSolverInterfaceTest.cpp:2098
WARNING sym setting solutions: reduced costs from solution set with setRowPrice
ok == true
OsiSolverInterfaceTest.cpp:1867
Severity NOTE : 7 thereof expected: 6
Severity PASSED : 873 thereof expected: 0
Severity WARNING : 5 thereof expected: 0
Severity ERROR : 0 thereof expected: 0
All tests completed successfully
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment