If you think that there is an error in how your package is being tested or represented, please file an issue at NewPkgEval.jl , making sure to read the FAQ first.
Results with Julia v1.2.0
Testing was successful .
Last evaluation was ago and took 4 minutes, 3 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed LinearFractional ───── v0.6.2
Installed Compat ─────────────── v2.2.0
Installed DiffResults ────────── v0.0.4
Installed DiffRules ──────────── v0.1.0
Installed DataStructures ─────── v0.17.6
Installed BinaryProvider ─────── v0.5.8
Installed MathOptInterface ───── v0.8.4
Installed JuMP ───────────────── v0.19.2
Installed OrderedCollections ─── v1.1.0
Installed NaNMath ────────────── v0.3.3
Installed StaticArrays ───────── v0.12.1
Installed SpecialFunctions ───── v0.8.0
Installed ForwardDiff ────────── v0.9.0
Installed CommonSubexpressions ─ v0.2.0
Installed Calculus ───────────── v0.5.1
Installed MacroTools ─────────── v0.5.2
Installed URIParser ──────────── v0.4.0
Installed BinDeps ────────────── v0.8.10
Updating `~/.julia/environments/v1.2/Project.toml`
[31851ddc] + LinearFractional v0.6.2
Updating `~/.julia/environments/v1.2/Manifest.toml`
[9e28174c] + BinDeps v0.8.10
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[864edb3b] + DataStructures v0.17.6
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[f6369f11] + ForwardDiff v0.9.0
[4076af6c] + JuMP v0.19.2
[31851ddc] + LinearFractional v0.6.2
[1914dd2f] + MacroTools v0.5.2
[b8f27783] + MathOptInterface v0.8.4
[77ba4419] + NaNMath v0.3.3
[bac558e1] + OrderedCollections v1.1.0
[276daf66] + SpecialFunctions v0.8.0
[90137ffa] + StaticArrays v0.12.1
[30578b45] + URIParser v0.4.0
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Building SpecialFunctions → `~/.julia/packages/SpecialFunctions/ne2iw/deps/build.log`
Testing LinearFractional
Resolving package versions...
Installed Cbc ───────────────── v0.6.3
Installed MathProgBase ──────── v0.7.7
Installed LinQuadOptInterface ─ v0.6.0
Installed Clp ───────────────── v0.6.2
Building Clp → `~/.julia/packages/Clp/IBQzB/deps/build.log`
Building Cbc → `~/.julia/packages/Cbc/rWU6K/deps/build.log`
Status `/tmp/jl_TQA6CJ/Manifest.toml`
[9e28174c] BinDeps v0.8.10
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[9961bab8] Cbc v0.6.3
[e2554f3b] Clp v0.6.2
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[864edb3b] DataStructures v0.17.6
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[f6369f11] ForwardDiff v0.9.0
[4076af6c] JuMP v0.19.2
[f8899e07] LinQuadOptInterface v0.6.0
[31851ddc] LinearFractional v0.6.2
[1914dd2f] MacroTools v0.5.2
[b8f27783] MathOptInterface v0.8.4
[fdba3010] MathProgBase v0.7.7
[77ba4419] NaNMath v0.3.3
[bac558e1] OrderedCollections v1.1.0
[276daf66] SpecialFunctions v0.8.0
[90137ffa] StaticArrays v0.12.1
[30578b45] URIParser v0.4.0
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
Test Summary: | Pass Total
Simple example | 3 3
Test Summary: | Pass Total
Array variables | 2 2
Test Summary: | Pass Total
Array constraints | 2 2
Test Summary: | Pass Total
Match LP | 2 2
Test Summary: | Pass Total
Constant denominator | 2 2
Coin0506I Presolve 4 (-2) rows, 3 (0) columns and 11 (-2) elements
Clp0006I 0 Obj 4.4408921e-15 Primal inf 0.37991684 (1) Dual inf 2.8430438 (1)
Clp0006I 2 Obj -1.0909091
Clp0000I Optimal - objective value -1.0909091
Coin0511I After Postsolve, objective -1.0909091, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -1.090909091 - 2 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 4 (-2) rows, 3 (0) columns and 11 (-2) elements
Clp0006I 0 Obj 4.4408921e-15 Primal inf 0.37991684 (1) Dual inf 2.8430438 (1)
Clp0006I 2 Obj -1.0909091
Clp0000I Optimal - objective value -1.0909091
Coin0511I After Postsolve, objective -1.0909091, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -1.090909091 - 2 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 3 (-2) rows, 2 (-1) columns and 6 (-5) elements
Clp0006I 0 Obj 0.05 Primal inf 0.01117934 (1) Dual inf 25.930676 (1)
Clp0006I 1 Obj -1.4310835e+10
Clp0006I 1 Obj -7.1554175e+10
Clp0002I Dual infeasible - objective value -7.1554175e+10
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0511I After Postsolve, objective -2, infeasibilities - dual 33.6 (2), primal 0.9999999 (1)
Clp0006I 0 Obj 0 Primal inf 0.2499999 (1) Dual inf 0.0099999 (1)
Clp0029I End of values pass after 1 iterations
Clp0006I 1 Obj 0
Clp0000I Optimal - objective value -0
Clp0006I 0 Obj -1.55 Dual inf 0.2862166 (1)
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0000I Optimal - objective value -1.55
Clp0032I Optimal objective -1.55 - 1 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-7) rows, 0 (-3) columns and 0 (-16) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value 10
Coin0511I After Postsolve, objective 10, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 10 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-7) rows, 0 (-3) columns and 0 (-16) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value 10
Coin0511I After Postsolve, objective 10, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 10 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-11) rows, 0 (-3) columns and 0 (-23) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value -4.8
Coin0511I After Postsolve, objective -4.8, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -4.8 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-2) rows, 0 (-2) columns and 0 (-4) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value -4.8
Coin0511I After Postsolve, objective -4.8, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -4.8 - 0 iterations time 0.002, Presolve 0.00
Test Summary: | Pass Total
Binary Variables | 5 5
Welcome to the CBC MILP Solver
Version: 2.9.9
Build Date: Dec 31 2018
command line - Cbc_C_Interface -solve -quit (default strategy 1)
Continuous objective value is 0 - 0.00 seconds
Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0004I processed model has 7 rows, 5 columns (2 integer (2 of which binary)) and 19 elements
Cbc0038I Initial state - 0 integers unsatisfied sum - 0
Cbc0038I Solution found of 0
Cbc0038I Relaxing continuous gives 0
Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 1 continuous
Cbc0038I Mini branch and bound did not improve solution (0.00 seconds)
Cbc0038I After 0.00 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds
Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.00 seconds)
Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.00 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Cuts at root node changed objective from 0 to 0
Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Optimal solution found
Objective value: 0.00000000
Enumerated nodes: 0
Total iterations: 0
Time (CPU seconds): 0.00
Time (Wallclock seconds): 0.00
Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01
Testing LinearFractional tests passed
Results with Julia v1.3.0
Testing was successful .
Last evaluation was ago and took 4 minutes, 16 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed LinearFractional ───── v0.6.2
Installed NaNMath ────────────── v0.3.3
Installed DiffResults ────────── v0.0.4
Installed OrderedCollections ─── v1.1.0
Installed SpecialFunctions ───── v0.9.0
Installed MacroTools ─────────── v0.5.2
Installed DataStructures ─────── v0.17.6
Installed ForwardDiff ────────── v0.9.0
Installed OpenSpecFun_jll ────── v0.5.3+1
Installed StaticArrays ───────── v0.12.1
Installed Compat ─────────────── v2.2.0
Installed Calculus ───────────── v0.5.1
Installed CommonSubexpressions ─ v0.2.0
Installed MathOptInterface ───── v0.8.4
Installed DiffRules ──────────── v0.1.0
Installed JuMP ───────────────── v0.19.2
Updating `~/.julia/environments/v1.3/Project.toml`
[31851ddc] + LinearFractional v0.6.2
Updating `~/.julia/environments/v1.3/Manifest.toml`
[49dc2e85] + Calculus v0.5.1
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[864edb3b] + DataStructures v0.17.6
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[f6369f11] + ForwardDiff v0.9.0
[4076af6c] + JuMP v0.19.2
[31851ddc] + LinearFractional v0.6.2
[1914dd2f] + MacroTools v0.5.2
[b8f27783] + MathOptInterface v0.8.4
[77ba4419] + NaNMath v0.3.3
[efe28fd5] + OpenSpecFun_jll v0.5.3+1
[bac558e1] + OrderedCollections v1.1.0
[276daf66] + SpecialFunctions v0.9.0
[90137ffa] + StaticArrays v0.12.1
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Testing LinearFractional
Resolving package versions...
Installed BinaryProvider ────── v0.5.8
Installed Cbc ───────────────── v0.6.3
Installed LinQuadOptInterface ─ v0.6.0
Installed Clp ───────────────── v0.6.2
Installed MathProgBase ──────── v0.7.7
Building Clp → `~/.julia/packages/Clp/IBQzB/deps/build.log`
Building Cbc → `~/.julia/packages/Cbc/rWU6K/deps/build.log`
Status `/tmp/jl_TsLxrH/Manifest.toml`
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[9961bab8] Cbc v0.6.3
[e2554f3b] Clp v0.6.2
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[864edb3b] DataStructures v0.17.6
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[f6369f11] ForwardDiff v0.9.0
[4076af6c] JuMP v0.19.2
[f8899e07] LinQuadOptInterface v0.6.0
[31851ddc] LinearFractional v0.6.2
[1914dd2f] MacroTools v0.5.2
[b8f27783] MathOptInterface v0.8.4
[fdba3010] MathProgBase v0.7.7
[77ba4419] NaNMath v0.3.3
[efe28fd5] OpenSpecFun_jll v0.5.3+1
[bac558e1] OrderedCollections v1.1.0
[276daf66] SpecialFunctions v0.9.0
[90137ffa] StaticArrays v0.12.1
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
Test Summary: | Pass Total
Simple example | 3 3
Test Summary: | Pass Total
Array variables | 2 2
Test Summary: | Pass Total
Array constraints | 2 2
Test Summary: | Pass Total
Match LP | 2 2
Test Summary: | Pass Total
Constant denominator | 2 2
Coin0506I Presolve 4 (-2) rows, 3 (0) columns and 11 (-2) elements
Clp0006I 0 Obj 4.4408921e-15 Primal inf 0.37991684 (1) Dual inf 2.8430438 (1)
Clp0006I 2 Obj -1.0909091
Clp0000I Optimal - objective value -1.0909091
Coin0511I After Postsolve, objective -1.0909091, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -1.090909091 - 2 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 4 (-2) rows, 3 (0) columns and 11 (-2) elements
Clp0006I 0 Obj 4.4408921e-15 Primal inf 0.37991684 (1) Dual inf 2.8430438 (1)
Clp0006I 2 Obj -1.0909091
Clp0000I Optimal - objective value -1.0909091
Coin0511I After Postsolve, objective -1.0909091, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -1.090909091 - 2 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 3 (-2) rows, 2 (-1) columns and 6 (-5) elements
Clp0006I 0 Obj 0.05 Primal inf 0.01117934 (1) Dual inf 25.930676 (1)
Clp0006I 1 Obj -1.4310835e+10
Clp0006I 1 Obj -7.1554175e+10
Clp0002I Dual infeasible - objective value -7.1554175e+10
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0511I After Postsolve, objective -2, infeasibilities - dual 33.6 (2), primal 0.9999999 (1)
Clp0006I 0 Obj 0 Primal inf 0.2499999 (1) Dual inf 0.0099999 (1)
Clp0029I End of values pass after 1 iterations
Clp0006I 1 Obj 0
Clp0000I Optimal - objective value -0
Clp0006I 0 Obj -1.55 Dual inf 0.2862166 (1)
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0000I Optimal - objective value -1.55
Clp0032I Optimal objective -1.55 - 1 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-7) rows, 0 (-3) columns and 0 (-16) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value 10
Coin0511I After Postsolve, objective 10, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 10 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-7) rows, 0 (-3) columns and 0 (-16) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value 10
Coin0511I After Postsolve, objective 10, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 10 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-11) rows, 0 (-3) columns and 0 (-23) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value -4.8
Coin0511I After Postsolve, objective -4.8, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -4.8 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-2) rows, 0 (-2) columns and 0 (-4) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value -4.8
Coin0511I After Postsolve, objective -4.8, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -4.8 - 0 iterations time 0.002, Presolve 0.00
Test Summary: | Pass Total
Binary Variables | 5 5
Welcome to the CBC MILP Solver
Version: 2.9.9
Build Date: Dec 31 2018
command line - Cbc_C_Interface -solve -quit (default strategy 1)
Continuous objective value is 0 - 0.00 seconds
Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0004I processed model has 7 rows, 5 columns (2 integer (2 of which binary)) and 19 elements
Cbc0038I Initial state - 0 integers unsatisfied sum - 0
Cbc0038I Solution found of 0
Cbc0038I Relaxing continuous gives 0
Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 1 continuous
Cbc0038I Mini branch and bound did not improve solution (0.00 seconds)
Cbc0038I After 0.00 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds
Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.00 seconds)
Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.00 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Cuts at root node changed objective from 0 to 0
Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Optimal solution found
Objective value: 0.00000000
Enumerated nodes: 0
Total iterations: 0
Time (CPU seconds): 0.01
Time (Wallclock seconds): 0.01
Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01
Testing LinearFractional tests passed
Results with Julia v1.3.1-pre-7704df0a5a
Testing was successful .
Last evaluation was ago and took 4 minutes, 19 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed LinearFractional ───── v0.6.2
Installed Compat ─────────────── v2.2.0
Installed DiffResults ────────── v0.0.4
Installed StaticArrays ───────── v0.12.1
Installed MacroTools ─────────── v0.5.2
Installed ForwardDiff ────────── v0.9.0
Installed MathOptInterface ───── v0.8.4
Installed JuMP ───────────────── v0.19.2
Installed DataStructures ─────── v0.17.6
Installed NaNMath ────────────── v0.3.3
Installed OrderedCollections ─── v1.1.0
Installed Calculus ───────────── v0.5.1
Installed OpenSpecFun_jll ────── v0.5.3+1
Installed CommonSubexpressions ─ v0.2.0
Installed DiffRules ──────────── v0.1.0
Installed SpecialFunctions ───── v0.9.0
Updating `~/.julia/environments/v1.3/Project.toml`
[31851ddc] + LinearFractional v0.6.2
Updating `~/.julia/environments/v1.3/Manifest.toml`
[49dc2e85] + Calculus v0.5.1
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[864edb3b] + DataStructures v0.17.6
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[f6369f11] + ForwardDiff v0.9.0
[4076af6c] + JuMP v0.19.2
[31851ddc] + LinearFractional v0.6.2
[1914dd2f] + MacroTools v0.5.2
[b8f27783] + MathOptInterface v0.8.4
[77ba4419] + NaNMath v0.3.3
[efe28fd5] + OpenSpecFun_jll v0.5.3+1
[bac558e1] + OrderedCollections v1.1.0
[276daf66] + SpecialFunctions v0.9.0
[90137ffa] + StaticArrays v0.12.1
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Testing LinearFractional
Resolving package versions...
Installed MathProgBase ──────── v0.7.7
Installed LinQuadOptInterface ─ v0.6.0
Installed Clp ───────────────── v0.6.2
Installed Cbc ───────────────── v0.6.3
Installed BinaryProvider ────── v0.5.8
Building Clp → `~/.julia/packages/Clp/IBQzB/deps/build.log`
Building Cbc → `~/.julia/packages/Cbc/rWU6K/deps/build.log`
Status `/tmp/jl_ZqVl5S/Manifest.toml`
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[9961bab8] Cbc v0.6.3
[e2554f3b] Clp v0.6.2
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[864edb3b] DataStructures v0.17.6
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[f6369f11] ForwardDiff v0.9.0
[4076af6c] JuMP v0.19.2
[f8899e07] LinQuadOptInterface v0.6.0
[31851ddc] LinearFractional v0.6.2
[1914dd2f] MacroTools v0.5.2
[b8f27783] MathOptInterface v0.8.4
[fdba3010] MathProgBase v0.7.7
[77ba4419] NaNMath v0.3.3
[efe28fd5] OpenSpecFun_jll v0.5.3+1
[bac558e1] OrderedCollections v1.1.0
[276daf66] SpecialFunctions v0.9.0
[90137ffa] StaticArrays v0.12.1
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
Test Summary: | Pass Total
Simple example | 3 3
Test Summary: | Pass Total
Array variables | 2 2
Test Summary: | Pass Total
Array constraints | 2 2
Test Summary: | Pass Total
Match LP | 2 2
Test Summary: | Pass Total
Constant denominator | 2 2
Coin0506I Presolve 4 (-2) rows, 3 (0) columns and 11 (-2) elements
Clp0006I 0 Obj 4.4408921e-15 Primal inf 0.37991684 (1) Dual inf 2.8430438 (1)
Clp0006I 2 Obj -1.0909091
Clp0000I Optimal - objective value -1.0909091
Coin0511I After Postsolve, objective -1.0909091, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -1.090909091 - 2 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 4 (-2) rows, 3 (0) columns and 11 (-2) elements
Clp0006I 0 Obj 4.4408921e-15 Primal inf 0.37991684 (1) Dual inf 2.8430438 (1)
Clp0006I 2 Obj -1.0909091
Clp0000I Optimal - objective value -1.0909091
Coin0511I After Postsolve, objective -1.0909091, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -1.090909091 - 2 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 3 (-2) rows, 2 (-1) columns and 6 (-5) elements
Clp0006I 0 Obj 0.05 Primal inf 0.01117934 (1) Dual inf 25.930676 (1)
Clp0006I 1 Obj -1.4310835e+10
Clp0006I 1 Obj -7.1554175e+10
Clp0002I Dual infeasible - objective value -7.1554175e+10
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0511I After Postsolve, objective -2, infeasibilities - dual 33.6 (2), primal 0.9999999 (1)
Clp0006I 0 Obj 0 Primal inf 0.2499999 (1) Dual inf 0.0099999 (1)
Clp0029I End of values pass after 1 iterations
Clp0006I 1 Obj 0
Clp0000I Optimal - objective value -0
Clp0006I 0 Obj -1.55 Dual inf 0.2862166 (1)
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0029I End of values pass after 0 iterations
Clp0006I 0 Obj -1.55
Clp0000I Optimal - objective value -1.55
Clp0032I Optimal objective -1.55 - 1 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-7) rows, 0 (-3) columns and 0 (-16) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value 10
Coin0511I After Postsolve, objective 10, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 10 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-7) rows, 0 (-3) columns and 0 (-16) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value 10
Coin0511I After Postsolve, objective 10, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 10 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-11) rows, 0 (-3) columns and 0 (-23) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value -4.8
Coin0511I After Postsolve, objective -4.8, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -4.8 - 0 iterations time 0.002, Presolve 0.00
Coin0506I Presolve 0 (-2) rows, 0 (-2) columns and 0 (-4) elements
Clp3002W Empty problem - 0 rows, 0 columns and 0 elements
Clp0000I Optimal - objective value -4.8
Coin0511I After Postsolve, objective -4.8, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective -4.8 - 0 iterations time 0.002, Presolve 0.00
Test Summary: | Pass Total
Binary Variables | 5 5
Welcome to the CBC MILP Solver
Version: 2.9.9
Build Date: Dec 31 2018
command line - Cbc_C_Interface -solve -quit (default strategy 1)
Continuous objective value is 0 - 0.00 seconds
Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions
Cgl0004I processed model has 7 rows, 5 columns (2 integer (2 of which binary)) and 19 elements
Cbc0038I Initial state - 0 integers unsatisfied sum - 0
Cbc0038I Solution found of 0
Cbc0038I Relaxing continuous gives 0
Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 1 continuous
Cbc0038I Mini branch and bound did not improve solution (0.00 seconds)
Cbc0038I After 0.00 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds
Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.00 seconds)
Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.00 seconds)
Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost
Cuts at root node changed objective from 0 to 0
Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Optimal solution found
Objective value: 0.00000000
Enumerated nodes: 0
Total iterations: 0
Time (CPU seconds): 0.01
Time (Wallclock seconds): 0.01
Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01
Testing LinearFractional tests passed