Package evaluation of PowerModelsACDC on Julia 1.13.0-DEV.582 (c0a1728d50*) started at 2025-05-14T14:26:48.811 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.09s ################################################################################ # Installation # Installing PowerModelsACDC... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [ff45984e] + PowerModelsACDC v0.8.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.14.0 [79e6a3ab] + Adapt v4.3.0 [4fba245c] + ArrayInterface v7.19.0 [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [187b0558] + ConstructionBase v1.5.8 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 ⌅ [a0c0ee7d] + DifferentiationInterface v0.6.54 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.4 [6a86dc24] + FiniteDiff v2.27.0 [f6369f11] + ForwardDiff v1.0.1 [2030c09a] + InfrastructureModels v0.7.8 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.2 [4076af6c] + JuMP v1.25.0 [d3d80556] + LineSearches v7.3.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.40.0 [f28f55f0] + Memento v1.4.1 [d8a4904e] + MutableArithmetics v1.6.4 [d41bc354] + NLSolversBase v7.9.1 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.0 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [c36e90e8] + PowerModels v0.21.3 [ff45984e] + PowerModelsACDC v0.8.0 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.12.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.32s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 160.04s ################################################################################ # Testing # Testing PowerModelsACDC Status `/tmp/jl_Mci5rd/Project.toml` ⌅ [87dc4568] HiGHS v1.9.3 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.3 [4076af6c] JuMP v1.25.0 [2ddba703] Juniper v0.9.3 [f28f55f0] Memento v1.4.1 [2774e3e8] NLsolve v4.5.1 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_Mci5rd/Manifest.toml` [47edcb42] ADTypes v1.14.0 [79e6a3ab] Adapt v4.3.0 [4fba245c] ArrayInterface v7.19.0 [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.5.8 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 ⌅ [a0c0ee7d] DifferentiationInterface v0.6.54 [b4f34e82] Distances v0.10.12 [ffbed154] DocStringExtensions v0.9.4 [6a86dc24] FiniteDiff v2.27.0 [f6369f11] ForwardDiff v1.0.1 ⌅ [87dc4568] HiGHS v1.9.3 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.3 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.2 [4076af6c] JuMP v1.25.0 [2ddba703] Juniper v0.9.3 [d3d80556] LineSearches v7.3.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.40.0 [f28f55f0] Memento v1.4.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.9.1 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.0 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [efcf1570] Setfield v1.1.2 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 ⌅ [8fd58aa0] HiGHS_jll v1.7.2+0 [e33a78d0] Hwloc_jll v2.12.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.12.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.2.25 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.12.0+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 53233.0 ms ✓ Ipopt → IpoptMathOptInterfaceExt 1 dependency successfully precompiled in 54 seconds. 73 already precompiled. Precompiling packages... 13128.6 ms ✓ Juniper 1 dependency successfully precompiled in 14 seconds. 52 already precompiled. Precompiling packages... 1546.5 ms ✓ HiGHS_jll 39817.9 ms ✓ HiGHS 2 dependencies successfully precompiled in 42 seconds. 51 already precompiled. ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 112 rows, 73 cols, 240 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 176 rows, 90 cols, 444 nonzeros 0s 155 rows, 69 cols, 455 nonzeros 0s 90 rows, 62 cols, 296 nonzeros 0s 86 rows, 58 cols, 293 nonzeros 0s Solving MIP model with: 86 rows 58 cols (16 binary, 0 integer, 0 implied int., 42 continuous) 293 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.2s 0 0 0 0.00% 20.06401564 inf inf 0 0 0 40 0.3s R 0 0 0 0.00% 22.06723944 27.9331482 21.00% 124 5 0 47 0.3s L 0 0 0 0.00% 25.55721761 26.3331482 2.95% 256 30 0 86 0.3s 12.5% inactive integer columns, restarting Model after restart has 78 rows, 53 cols (14 bin., 0 int., 0 impl., 39 cont.), and 272 nonzeros 0 0 0 0.00% 25.57800166 26.3331482 2.87% 16 0 0 165 0.4s 0 0 0 0.00% 25.57800166 26.3331482 2.87% 16 16 0 192 0.4s L 0 0 0 0.00% 26.02119318 26.3331482 1.18% 305 47 0 249 0.4s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 1.53432822003e-13 (int. viol.) 0 (row viol.) Timing 0.55 (total) 0.23 (presolve) 0.00 (postsolve) Nodes 5 LP iterations 575 (total) 104 (strong br.) 105 (separation) 249 (heuristics) 6-bus case: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:11 Expression: isapprox((((resultDC["solution"])["branchdc_ne"])["1"])["pf"], 1.77384; atol = 0.01) Evaluated: isapprox(1.3737131458180136, 1.77384; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:3 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:4 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [5] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:11 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] 6-bus case: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:12 Expression: isapprox((((resultDC["solution"])["branchdc_ne"])["1"])["pt"], -1.77384; atol = 0.01) Evaluated: isapprox(-1.3737131458180136, -1.77384; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:3 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:4 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [5] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:12 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 2e+01] Cost [1e+00, 5e+00] Bound [1e-01, 2e+01] RHS [9e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 9 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Row 4 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] Solution has num max sum Col infeasibilities 3 0.1 0.3 Integer infeasibilities 0 0 0 Row infeasibilities 24 7.2 70.96 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 2e+01] Cost [1e+00, 5e+00] Bound [1e-01, 2e+01] RHS [9e-01, 6e+00] Presolving model 48 rows, 32 cols, 108 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 63 rows, 35 cols, 148 nonzeros 0s 36 rows, 20 cols, 106 nonzeros 0s 25 rows, 19 cols, 76 nonzeros 0s 22 rows, 16 cols, 66 nonzeros 0s Objective function is integral with scale 10 Solving MIP model with: 22 rows 16 cols (3 binary, 0 integer, 0 implied int., 13 continuous) 66 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 7.5 inf inf 0 0 0 0 0.0s 33.3% inactive integer columns, restarting Solving report Status Optimal Primal bound 10.7 Dual bound 10.7 Gap 0% (tolerance: 0.01%) Solution status feasible 10.7 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 14 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [5e-01, 1e+01] RHS [1e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 0.774 from [lower, value, upper] = [ -2.826; -3.6; -2.826] WARNING: Row 2 has infeasibility of 2.949 from [lower, value, upper] = [ -0.651; -3.6; -0.651] WARNING: Row 35 has infeasibility of 32.47 from [lower, value, upper] = [ 0; 32.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 751 35.47 1674 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [5e-01, 1e+01] RHS [1e-01, 6e+00] Presolving model 682 rows, 372 cols, 1412 nonzeros 0s 72 rows, 40 cols, 205 nonzeros 0s 49 rows, 27 cols, 149 nonzeros 0s 35 rows, 20 cols, 107 nonzeros 0s 21 rows, 13 cols, 84 nonzeros 0s 11 rows, 8 cols, 44 nonzeros 0s 11 rows, 8 cols, 44 nonzeros 0s Presolve : Reductions: rows 11(-1431); columns 8(-824); elements 44(-3456) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.2499998369e+01 Pr: 11(71.4673) 0s 8 6.0424711362e+01 0s Model status : Infeasible Simplex iterations: 8 Objective value : 6.0424691621e+01 HiGHS run time : 0.00 Presolving model 1210 rows, 599 cols, 3030 nonzeros 0s 634 rows, 532 cols, 2004 nonzeros 0s 634 rows, 532 cols, 2004 nonzeros 0s Solving MIP model with: 634 rows 532 cols (227 binary, 0 integer, 0 implied int., 305 continuous) 2004 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 8.06450689 inf inf 0 0 0 495 0.0s C 0 0 0 0.00% 8.318069242 2485.692099 99.67% 33 14 0 570 0.1s L 0 0 0 0.00% 8.419988068 15.6920988 46.34% 143 58 0 765 1.0s L 0 0 0 0.00% 8.421975278 15.6920988 46.33% 157 65 0 1713 1.2s 59.9% inactive integer columns, restarting Model after restart has 361 rows, 259 cols (91 bin., 0 int., 0 impl., 168 cont.), and 1186 nonzeros 0 0 0 0.00% 8.421975278 15.6920988 46.33% 38 0 0 2207 1.3s 0 0 0 0.00% 8.421975278 15.6920988 46.33% 38 29 0 2273 1.3s Solving report Status Optimal Primal bound 15.6920988029 Dual bound 15.6920988029 Gap 0% (tolerance: 0.01%) Solution status feasible 15.6920988029 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 2.81 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 71 LP iterations 10711 (total) 4568 (strong br.) 292 (separation) 3347 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [1e+00, 5e+01] RHS [7e-02, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.22 from [lower, value, upper] = [ -3.22; 0; -3.22] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 225 11.47 576.2 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [1e+00, 5e+01] RHS [7e-02, 1e+01] Presolving model 326 rows, 198 cols, 731 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 479 rows, 254 cols, 1211 nonzeros 0s 396 rows, 199 cols, 1138 nonzeros 0s 233 rows, 186 cols, 761 nonzeros 0s 228 rows, 182 cols, 750 nonzeros 0s Solving MIP model with: 228 rows 182 cols (55 binary, 0 integer, 0 implied int., 127 continuous) 750 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.48 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 19.44392647 inf inf 0 0 0 178 0.0s R 0 0 0 0.00% 21.36112463 41.46054482 48.48% 206 23 0 221 0.1s L 0 0 0 0.00% 22.95282154 25.16054482 8.77% 430 52 2 302 0.3s L 0 0 0 0.00% 22.97692773 25.16054482 8.68% 441 46 2 666 0.8s 5.5% inactive integer columns, restarting Model after restart has 210 rows, 169 cols (52 bin., 0 int., 0 impl., 117 cont.), and 705 nonzeros 0 0 0 0.00% 22.97692773 25.16054482 8.68% 19 0 0 1197 0.8s 0 0 0 0.00% 22.97692773 25.16054482 8.68% 19 19 0 1245 0.8s Solving report Status Optimal Primal bound 25.1605448204 Dual bound 25.1605448204 Gap 0% (tolerance: 0.01%) Solution status feasible 25.1605448204 (objective) 0 (bound viol.) 1.2482441598e-13 (int. viol.) 0 (row viol.) Timing 1.79 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 11 LP iterations 3538 (total) 607 (strong br.) 172 (separation) 2331 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 171 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 15.785148859024048 Relaxation Obj: 20.983698331666023 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [1e-07, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 117 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 55 7.473 107.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [1e-07, 2e+00] Presolving model 131 rows, 109 cols, 168 nonzeros 0s 3 rows, 4 cols, 6 nonzeros 0s Presolve : Reductions: rows 3(-237); columns 4(-201); elements 6(-507) Solving the presolved LP Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 6.7368056333e+00 HiGHS run time : 0.00 Presolving model 215 rows, 151 cols, 458 nonzeros 0s 115 rows, 87 cols, 296 nonzeros 0s 97 rows, 65 cols, 228 nonzeros 0s 71 rows, 52 cols, 176 nonzeros 0s 47 rows, 41 cols, 126 nonzeros 0s MIP start solution is feasible, objective value is 6.73680563326 Solving MIP model with: 47 rows 41 cols (11 binary, 0 integer, 4 implied int., 26 continuous) 126 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 2.406351217 6.736805633 64.28% 0 0 0 0 0.0s T 0 0 0 0.00% 2.406351217 2.406353594 0.00% 0 0 0 23 0.0s Solving report Status Optimal Primal bound 2.40635359402 Dual bound 2.40635359402 Gap 0% (tolerance: 0.01%) Solution status feasible 2.40635359402 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 23 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 2.4064 0.087 30.9 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 117 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 71 7.473 115.1 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 275 rows, 185 cols, 627 nonzeros 0s 164 rows, 117 cols, 438 nonzeros 0s 143 rows, 92 cols, 358 nonzeros 0s 117 rows, 79 cols, 306 nonzeros 0s 75 rows, 52 cols, 198 nonzeros 0s Solving MIP model with: 75 rows 52 cols (16 binary, 0 integer, 1 implied int., 35 continuous) 198 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4301982003 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.9963426022 0.9988794817 0.25% 0 0 0 39 0.0s 37.5% inactive integer columns, restarting Solving report Status Optimal Primal bound 0.998879481704 Dual bound 0.998879481704 Gap 0% (tolerance: 0.01%) Solution status feasible 0.998879481704 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 39 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.9989 0.0163 33.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 117 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 78 7.473 121.5 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 327 rows, 219 cols, 848 nonzeros 0s 216 rows, 151 cols, 654 nonzeros 0s 174 rows, 117 cols, 476 nonzeros 0s 159 rows, 53 cols, 220 nonzeros 0s 54 rows, 40 cols, 129 nonzeros 0s 48 rows, 37 cols, 113 nonzeros 0s Solving MIP model with: 48 rows 37 cols (11 binary, 0 integer, 0 implied int., 26 continuous) 113 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.1810060369 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.1850482224 0.1850508734 0.00% 0 0 0 33 0.0s Solving report Status Optimal Primal bound 0.185050873422 Dual bound 0.185048222364 Gap 0.00143% (tolerance: 0.01%) Solution status feasible 0.185050873422 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 33 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.1851 0.0163 34.1 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 117 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 85 7.473 128.5 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 379 rows, 253 cols, 1137 nonzeros 0s 265 rows, 183 cols, 926 nonzeros 0s 222 rows, 149 cols, 620 nonzeros 0s 191 rows, 53 cols, 221 nonzeros 0s 54 rows, 40 cols, 129 nonzeros 0s 48 rows, 37 cols, 113 nonzeros 0s Solving MIP model with: 48 rows 37 cols (11 binary, 0 integer, 0 implied int., 26 continuous) 113 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.1810060369 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.1850482224 0.1850508734 0.00% 0 0 0 33 0.0s Solving report Status Optimal Primal bound 0.185050873422 Dual bound 0.185048222364 Gap 0.00143% (tolerance: 0.01%) Solution status feasible 0.185050873422 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 33 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 34.292041063308716 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 20.98 - 10.3 4 - 3 3 - 29.84 - 11.8 - 93.5% 4 3 - 31.27 - 11.9 - 77.4% 5 4 - 30.97 - 12.1 - 77.1% 6 5 - 31.14 - 12.2 - 86.6% 7 6 - 31.39 - 12.3 - 26.0% 8 7 - 31.4 - 12.7 - 95.7% 9 4 - 31.48 - 13.6 - 84.0% 10 5 - 31.62 - 13.7 - 84.3% 7 4 33.27 31.89 4.15% 13.9 - 92.5% 7 5 33.27 31.67 4.81% 14.0 - 97.1% 7 6 33.2 31.99 3.65% 14.1 - 92.8% 7 6 33.2 32.13 3.23% 14.3 - 64.0% 8 4 33.2 32.15 3.16% 14.5 - 97.1% 9 5 33.2 31.92 3.86% 14.6 - 65.0% 10 6 33.2 31.41 5.41% 14.7 - 80.2% 11 7 33.2 31.9 3.9% 14.8 - 18.6% 11 8 33.2 32.05 3.47% 15.0 - 94.6% 11 6 33.2 32.07 3.4% 15.2 - 86.5% 11 7 33.2 32.07 3.4% 15.3 - 89.9% 11 8 33.2 32.15 3.16% 15.4 - 80.8% 11 5 33.2 32.2 3.03% 15.6 - 93.7% 11 6 33.2 32.2 3.01% 15.7 - 98.7% 0 7 32.200611 32.200612 0.0% 15.8 - 98.5% #branches: 24 Obj: 32.20061146337752 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 94 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.2321929931640625 Relaxation Obj: 1.4678142298092867 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [4e-06, 1e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 18 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 76 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] Solution has num max sum Col infeasibilities 5 3.6 7.5 Integer infeasibilities 0 0 0 Row infeasibilities 20 7.2 33 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [4e-06, 1e+00] Presolving model 36 rows, 35 cols, 48 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-89); columns 0(-102); elements 0(-185) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 1.9552835781e+00 HiGHS run time : 0.00 Presolving model 55 rows, 44 cols, 107 nonzeros 0s 22 rows, 19 cols, 52 nonzeros 0s 18 rows, 11 cols, 38 nonzeros 0s 12 rows, 8 cols, 26 nonzeros 0s 8 rows, 6 cols, 18 nonzeros 0s MIP start solution is feasible, objective value is 1.95528357808 Solving MIP model with: 8 rows 6 cols (3 binary, 0 integer, 0 implied int., 3 continuous) 18 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.129323942 1.955283578 42.24% 0 0 0 0 0.0s R 0 0 0 0.00% 1.12932752 1.12932752 0.00% 0 0 0 4 0.0s Solving report Status Optimal Primal bound 1.12932752045 Dual bound 1.12932752044 Gap 0% (tolerance: 0.01%) Solution status feasible 1.12932752045 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 4 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:405 1.1293 - 1.6 FP: 1.558262825012207 s FP: 1 round FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 1 2 10.7 1.47 86.28% 0.5 2 - 0 3 10.7 9.73 9.07% 0.6 - 87.4% #branches: 2 Obj: 10.700000447069831 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 223 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.5057950019836426 Relaxation Obj: 15.877095202614878 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [2e-07, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 159 53.6 2617 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [2e-07, 1e+02] Presolving model 600 rows, 229 cols, 1610 nonzeros 0s 331 rows, 113 cols, 1192 nonzeros 0s 310 rows, 113 cols, 1104 nonzeros 0s Presolve : Reductions: rows 310(-586); columns 113(-144); elements 1104(-1369) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.8657329460e+00 Pr: 109(1234.92) 0s 124 5.8662944464e+00 0s Model status : Infeasible Simplex iterations: 124 Objective value : 5.8657669921e+00 HiGHS run time : 0.01 Presolving model 735 rows, 246 cols, 2160 nonzeros 0s 644 rows, 155 cols, 2155 nonzeros 0s 531 rows, 132 cols, 1814 nonzeros 0s Solving MIP model with: 531 rows 132 cols (16 binary, 0 integer, 1 implied int., 115 continuous) 1814 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.078975576 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 3.078975576 inf inf 0 0 8 141 0.0s C 0 0 0 0.00% 4.08126016 6.499230981 37.20% 232 13 23 261 0.1s L 0 0 0 0.00% 4.321525727 4.360247596 0.89% 189 22 23 307 0.2s Solving report Status Optimal Primal bound 4.36024759644 Dual bound 4.36024300517 Gap 0.000105% (tolerance: 0.01%) Solution status feasible 4.36024759644 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.22 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 425 (total) 0 (strong br.) 182 (separation) 87 (heuristics) 4.3602 1.6e-5 0.3 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 172 53.6 2620 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 791 rows, 280 cols, 2321 nonzeros 0s 700 rows, 189 cols, 2316 nonzeros 0s 556 rows, 144 cols, 1875 nonzeros 0s Solving MIP model with: 556 rows 144 cols (16 binary, 0 integer, 0 implied int., 128 continuous) 1875 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00427744301 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.000758461 1.012116529 1.12% 0 0 0 225 0.0s 81.2% inactive integer columns, restarting Model after restart has 370 rows, 92 cols (3 bin., 0 int., 0 impl., 89 cont.), and 1296 nonzeros 0 0 0 0.00% 1.01138296 1.012116529 0.07% 2 0 0 282 0.1s R 0 0 0 0.00% 1.01138296 1.012116529 0.07% 2 2 0 317 0.1s Solving report Status Optimal Primal bound 1.01211652944 Dual bound 1.01211652944 Gap 0% (tolerance: 0.01%) Solution status feasible 1.01211652944 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.11 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 356 (total) 0 (strong br.) 61 (separation) 35 (heuristics) 1.0121 1.3e-5 0.6 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 176 53.6 2623 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 843 rows, 314 cols, 2542 nonzeros 0s 752 rows, 223 cols, 2537 nonzeros 0s 666 rows, 147 cols, 1965 nonzeros 0s 557 rows, 145 cols, 1863 nonzeros 0s Solving MIP model with: 557 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1863 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283882 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 167 0.0s Solving report Status Optimal Primal bound 0.0145090247715 Dual bound 0.0145090247715 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090247715 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 0.7 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 180 53.6 2627 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 895 rows, 348 cols, 2831 nonzeros 0s 770 rows, 244 cols, 2735 nonzeros 0s 698 rows, 147 cols, 1966 nonzeros 0s 557 rows, 145 cols, 1863 nonzeros 0s Solving MIP model with: 557 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1863 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283882 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 167 0.0s Solving report Status Optimal Primal bound 0.0145090247899 Dual bound 0.0145090247899 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090247899 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 0.9 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 184 53.6 2631 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 947 rows, 382 cols, 3188 nonzeros 0s 819 rows, 276 cols, 3071 nonzeros 0s 730 rows, 147 cols, 1966 nonzeros 0s 557 rows, 145 cols, 1863 nonzeros 0s Solving MIP model with: 557 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1863 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283882 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 167 0.0s Solving report Status Optimal Primal bound 0.0145090247899 Dual bound 0.0145090247899 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090247899 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.02 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 1.1 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 188 53.6 2635 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 999 rows, 416 cols, 3613 nonzeros 0s 868 rows, 308 cols, 3471 nonzeros 0s 762 rows, 147 cols, 1966 nonzeros 0s 557 rows, 145 cols, 1863 nonzeros 0s Solving MIP model with: 557 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1863 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283882 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 167 0.0s Solving report Status Optimal Primal bound 0.0145090247899 Dual bound 0.0145090247899 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090247899 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.02 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 1.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 192 53.6 2639 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1051 rows, 450 cols, 4106 nonzeros 0s 917 rows, 340 cols, 3935 nonzeros 0s 794 rows, 147 cols, 1966 nonzeros 0s 557 rows, 145 cols, 1863 nonzeros 0s Solving MIP model with: 557 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1863 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283882 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 167 0.0s Solving report Status Optimal Primal bound 0.0145090247899 Dual bound 0.0145090247899 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090247899 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.02 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 1.4 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 196 53.6 2643 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1103 rows, 484 cols, 4667 nonzeros 0s 966 rows, 372 cols, 4463 nonzeros 0s 826 rows, 147 cols, 1966 nonzeros 0s 557 rows, 145 cols, 1863 nonzeros 0s Solving MIP model with: 557 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1863 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283882 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 167 0.0s Solving report Status Optimal Primal bound 0.0145090247899 Dual bound 0.0145090247899 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090247899 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.02 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) 0.0145 1.3e-5 1.6 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 39 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 200 53.6 2647 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1155 rows, 518 cols, 5296 nonzeros 0s 1015 rows, 404 cols, 5055 nonzeros 0s 858 rows, 147 cols, 1966 nonzeros 0s 557 rows, 145 cols, 1863 nonzeros 0s Solving MIP model with: 557 rows 145 cols (16 binary, 0 integer, 0 implied int., 129 continuous) 1863 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283882 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 167 0.0s Solving report Status Optimal Primal bound 0.0145090247899 Dual bound 0.0145090247899 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090247899 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.02 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 186 (total) 0 (strong br.) 19 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 1.6512949466705322 s FP: 9 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 15.88 - 8.0 4 - 3 3 - 28.7 - 8.2 - 60.6% 4 4 - 28.9 - 8.5 - 67.7% 5 5 - 29.07 - 8.7 - 90.3% 6 5 - 29.49 - 9.0 - 76.0% 7 6 - 29.49 - 9.3 - 82.2% 8 6 - 29.53 - 9.6 - 83.7% 9 4 - 29.75 - 9.8 - 24.7% 10 5 - 29.78 - 10.1 - 89.1% 11 6 - 29.88 - 10.3 - 73.4% 12 7 - 29.94 - 10.6 - 60.2% 13 8 - 29.94 - 10.8 - 81.3% 13 7 - 30.08 - 11.2 - 90.4% 13 7 - 30.18 - 11.8 - 73.7% 13 7 - 30.3 - 12.3 - 91.5% 13 7 33.82 30.33 10.32% 12.5 - 93.0% 14 3 33.82 30.36 10.22% 12.8 - 80.6% 15 4 33.82 30.36 10.22% 13.1 - 88.0% 11 5 32.08 30.36 5.35% 13.5 - 89.6% 11 8 32.08 30.43 5.14% 13.8 - 96.1% 11 9 32.08 30.43 5.14% 14.1 - 90.6% 11 10 32.08 30.43 5.14% 14.4 - 95.9% 0 5 30.481486 30.481487 0.0% 14.8 - 92.0% #branches: 23 Obj: 30.481486164042042 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 114 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.17884492874145508 Relaxation Obj: 0.634623236728719 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [6e-06, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 88 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 59 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 58 11.13 164.1 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [6e-06, 1e+02] Presolving model 198 rows, 101 cols, 622 nonzeros 0s 135 rows, 68 cols, 519 nonzeros 0s 128 rows, 65 cols, 493 nonzeros 0s Presolve : Reductions: rows 128(-187); columns 65(-57); elements 493(-416) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 2.0887751259e+00 Pr: 59(199.815); Du: 0(2.11126e-12) 0s 56 2.0888029511e+00 0s Model status : Infeasible Simplex iterations: 56 Objective value : 2.0887615136e+00 HiGHS run time : 0.00 Presolving model 230 rows, 104 cols, 727 nonzeros 0s 192 rows, 78 cols, 691 nonzeros 0s 175 rows, 70 cols, 637 nonzeros 0s Solving MIP model with: 175 rows 70 cols (3 binary, 0 integer, 0 implied int., 67 continuous) 637 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.177614989 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 1.383960841 inf inf 0 0 0 72 0.0s C 0 0 0 0.00% 2.194869779 3.733714696 41.21% 14 0 0 86 0.0s H 0 0 0 0.00% 2.194869779 2.733727506 19.71% 14 0 0 86 0.0s Solving report Status Optimal Primal bound 2.73372750635 Dual bound 2.73372750635 Gap 0% (tolerance: 0.01%) Solution status feasible 2.73372750635 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 96 (total) 0 (strong br.) 14 (separation) 10 (heuristics) 2.7337 3.0e-6 0.1 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-03, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 88 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 59 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 60 11.13 165 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-03, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 228 rows, 108 cols, 741 nonzeros 0s 199 rows, 81 cols, 722 nonzeros 0s 176 rows, 69 cols, 627 nonzeros 0s Solving MIP model with: 176 rows 69 cols (3 binary, 0 integer, 0 implied int., 66 continuous) 627 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00189701304 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.9996340791 1.001196942 0.16% 0 0 0 53 0.0s Solving report Status Optimal Primal bound 1.00119694198 Dual bound 1.00119694198 Gap 0% (tolerance: 0.01%) Solution status feasible 1.00119694198 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 55 (total) 0 (strong br.) 2 (separation) 0 (heuristics) 1.0012 5.0e-6 0.1 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 88 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 59 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 63 11.13 169 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 238 rows, 114 cols, 780 nonzeros 0s 209 rows, 87 cols, 761 nonzeros 0s 172 rows, 68 cols, 631 nonzeros 0s 171 rows, 67 cols, 616 nonzeros 0s Solving MIP model with: 171 rows 67 cols (3 binary, 0 integer, 0 implied int., 64 continuous) 616 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00429099645 inf inf 0 0 0 0 0.0s Solving report Status Optimal Primal bound 0.00429099644923 Dual bound 0.00429099644923 Gap 0% (tolerance: 0.01%) Solution status feasible 0.00429099644923 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 46 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0043 5.0e-6 0.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 2.7] WARNING: Col 88 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 7 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 0] WARNING: Row 59 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 66 11.13 172 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 248 rows, 120 cols, 831 nonzeros 0s 219 rows, 93 cols, 812 nonzeros 0s 172 rows, 68 cols, 631 nonzeros 0s 171 rows, 67 cols, 616 nonzeros 0s Solving MIP model with: 171 rows 67 cols (3 binary, 0 integer, 0 implied int., 64 continuous) 616 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00435169335 inf inf 0 0 0 0 0.0s Solving report Status Optimal Primal bound 0.00435169335189 Dual bound 0.00435169335189 Gap 0% (tolerance: 0.01%) Solution status feasible 0.00435169335189 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 46 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.21620702743530273 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 1 2 10.7 0.63 94.07% 0.6 2 - 0 3 10.7 9.73 9.11% 0.8 - 87.0% #branches: 2 Obj: 10.700000760133749 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 23 2 25.48 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 71 rows, 42 cols, 145 nonzeros 0s 22 rows, 14 cols, 53 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 107 rows, 50 cols, 268 nonzeros 0s 90 rows, 33 cols, 271 nonzeros 0s 59 rows, 31 cols, 204 nonzeros 0s 58 rows, 30 cols, 213 nonzeros 0s Solving MIP model with: 58 rows 30 cols (8 binary, 0 integer, 0 implied int., 22 continuous) 213 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -400 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 311.1639469 inf inf 0 0 0 37 0.0s S 0 0 0 0.00% 311.1639469 330.0287812 5.72% 46 3 0 38 0.0s S 0 0 0 0.00% 318.1522349 330.0287812 3.60% 46 3 0 48 0.0s L 0 0 0 0.00% 318.1522349 329.9545624 3.58% 46 3 0 48 0.0s 50.0% inactive integer columns, restarting Model after restart has 34 rows, 21 cols (3 bin., 0 int., 0 impl., 18 cont.), and 105 nonzeros 0 0 0 0.00% 318.1522349 329.9545624 3.58% 1 0 0 48 0.0s 0 0 0 0.00% 318.1522349 329.9545624 3.58% 1 1 0 54 0.0s Solving report Status Optimal Primal bound 329.954562409 Dual bound 329.954562409 Gap 0% (tolerance: 0.01%) Solution status feasible 329.954562409 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 56 (total) 0 (strong br.) 13 (separation) 0 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 125 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.7157280445098877 Relaxation Obj: 333.01468808160837 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [6e-09, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 18 2 18.03 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [6e-09, 2e+00] Presolving model 71 rows, 54 cols, 97 nonzeros 0s 2 rows, 12 cols, 8 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-137); columns 0(-141); elements 0(-283) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.7375769321e+00 HiGHS run time : 0.00 Presolving model 115 rows, 70 cols, 237 nonzeros 0s 66 rows, 39 cols, 154 nonzeros 0s 49 rows, 30 cols, 108 nonzeros 0s 33 rows, 22 cols, 76 nonzeros 0s 23 rows, 17 cols, 52 nonzeros 0s MIP start solution is feasible, objective value is 3.73757693211 Solving MIP model with: 23 rows 17 cols (6 binary, 0 integer, 4 implied int., 7 continuous) 52 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.737576923 3.737576932 80.27% 0 0 0 0 0.0s T 0 0 0 0.00% 0.737576923 0.7375775024 0.00% 0 0 0 8 0.0s Solving report Status Optimal Primal bound 0.737577502413 Dual bound 0.737577502413 Gap 0% (tolerance: 0.01%) Solution status feasible 0.737577502413 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 8 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.7376 0.0477 0.8 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [8e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 25 2 21.44 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [8e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 144 rows, 86 cols, 317 nonzeros 0s 93 rows, 55 cols, 228 nonzeros 0s 78 rows, 47 cols, 186 nonzeros 0s 62 rows, 39 cols, 154 nonzeros 0s 31 rows, 19 cols, 77 nonzeros 0s Solving MIP model with: 31 rows 19 cols (7 binary, 0 integer, 1 implied int., 11 continuous) 77 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4399746161 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.113581179 1.114358617 0.07% 0 0 0 15 0.0s 57.1% inactive integer columns, restarting Solving report Status Optimal Primal bound 1.11435861739 Dual bound 1.11435861739 Gap 0% (tolerance: 0.01%) Solution status feasible 1.11435861739 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 15 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:405 1.1144 - 8.6 FP: 8.607848882675171 s FP: 2 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 333.01 - 0.6 0 - 1 3 348.02 343.77 1.22% 0.7 - 74.2% 0 4 348.02 344.32 1.06% 0.8 - 45.1% #branches: 3 Obj: 348.0219281829846 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 156 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.5840110778808594 Relaxation Obj: 313.6305655146919 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [3e-08, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 31 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 89 50 2235 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [3e-08, 5e+01] Presolving model 411 rows, 141 cols, 1157 nonzeros 0s 297 rows, 92 cols, 968 nonzeros 0s 260 rows, 83 cols, 867 nonzeros 0s Presolve : Reductions: rows 260(-397); columns 83(-89); elements 867(-939) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 4.0741212310e+00 Pr: 90(861.132); Du: 0(4.01042e-12) 0s 79 4.0742213358e+00 0s Model status : Infeasible Simplex iterations: 79 Objective value : 4.0741441209e+00 HiGHS run time : 0.00 Presolving model 501 rows, 149 cols, 1482 nonzeros 0s 449 rows, 97 cols, 1449 nonzeros 0s 353 rows, 83 cols, 1185 nonzeros 0s Solving MIP model with: 353 rows 83 cols (8 binary, 0 integer, 3 implied int., 72 continuous) 1185 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.5062456824 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 0.7729977706 inf inf 0 0 7 81 0.0s R 0 0 0 0.00% 1.230010278 1.531645449 19.69% 66 1 7 94 0.1s 62.5% inactive integer columns, restarting Model after restart has 220 rows, 53 cols (3 bin., 0 int., 0 impl., 50 cont.), and 740 nonzeros 0 0 0 0.00% 1.230010278 1.531645449 19.69% 1 0 0 103 0.1s 0 0 0 0.00% 1.230010285 1.531645449 19.69% 1 1 2 118 0.1s Solving report Status Optimal Primal bound 1.53164544935 Dual bound 1.53164544935 Gap 0% (tolerance: 0.01%) Solution status feasible 1.53164544935 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.08 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 118 (total) 0 (strong br.) 13 (separation) 9 (heuristics) 1.5316 1.2e-5 0.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 31 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 96 50 2240 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 530 rows, 165 cols, 1562 nonzeros 0s 476 rows, 111 cols, 1538 nonzeros 0s 357 rows, 82 cols, 1209 nonzeros 0s 357 rows, 82 cols, 1209 nonzeros 0s Solving MIP model with: 357 rows 82 cols (8 binary, 0 integer, 0 implied int., 74 continuous) 1209 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00528047775 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.001715418 1.005593774 0.39% 0 0 0 123 0.0s Solving report Status Optimal Primal bound 1.00559377354 Dual bound 1.00559377354 Gap 0% (tolerance: 0.01%) Solution status feasible 1.00559377354 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 128 (total) 0 (strong br.) 5 (separation) 0 (heuristics) 1.0056 1.0e-5 0.3 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 31 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 100 50 2243 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 555 rows, 181 cols, 1666 nonzeros 0s 455 rows, 123 cols, 1437 nonzeros 0s 358 rows, 83 cols, 1205 nonzeros 0s 358 rows, 83 cols, 1205 nonzeros 0s Solving MIP model with: 358 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1205 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00347179693 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0081936779 0.00819744719 0.05% 0 0 0 85 0.0s 25.0% inactive integer columns, restarting Solving report Status Optimal Primal bound 0.00819744719334 Dual bound 0.00819744719334 Gap 0% (tolerance: 0.01%) Solution status feasible 0.00819744719334 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 85 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0082 1.0e-5 0.4 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 31 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 104 50 2247 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 580 rows, 197 cols, 1802 nonzeros 0s 479 rows, 139 cols, 1509 nonzeros 0s 358 rows, 83 cols, 1205 nonzeros 0s 358 rows, 83 cols, 1205 nonzeros 0s Solving MIP model with: 358 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1205 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00347178917 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819366653 0.00819743582 0.05% 0 0 0 86 0.0s 25.0% inactive integer columns, restarting Solving report Status Optimal Primal bound 0.00819743581845 Dual bound 0.00819743581845 Gap 0% (tolerance: 0.01%) Solution status feasible 0.00819743581845 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 86 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.4208550453186035 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 313.63 - 2.4 0 - 3 3 - 317.71 - 2.9 - 71.7% 4 4 - 329.96 - 3.5 - 63.9% 0 5 333.1 331.65 0.44% 4.0 - 381.7% #branches: 4 Obj: 333.0951967704946 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 112 rows, 73 cols, 240 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 176 rows, 90 cols, 444 nonzeros 0s 155 rows, 69 cols, 455 nonzeros 0s 90 rows, 62 cols, 296 nonzeros 0s 86 rows, 58 cols, 293 nonzeros 0s Solving MIP model with: 86 rows 58 cols (16 binary, 0 integer, 0 implied int., 42 continuous) 293 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 20.06401564 inf inf 0 0 0 40 0.0s R 0 0 0 0.00% 22.06723944 27.9331482 21.00% 124 5 0 47 0.0s L 0 0 0 0.00% 25.55721761 26.3331482 2.95% 256 30 0 86 0.1s 12.5% inactive integer columns, restarting Model after restart has 78 rows, 53 cols (14 bin., 0 int., 0 impl., 39 cont.), and 272 nonzeros 0 0 0 0.00% 25.57800166 26.3331482 2.87% 16 0 0 165 0.1s 0 0 0 0.00% 25.57800166 26.3331482 2.87% 16 16 0 192 0.1s L 0 0 0 0.00% 26.02119318 26.3331482 1.18% 305 47 0 249 0.2s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 1.53432822003e-13 (int. viol.) 0 (row viol.) Timing 0.25 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 5 LP iterations 575 (total) 104 (strong br.) 105 (separation) 249 (heuristics) AC and DC Candidates: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:235 Expression: isapprox((((result["solution"])["branchdc_ne"])["1"])["pf"], 1.77384; atol = 0.01) Evaluated: isapprox(1.3737131458180136, 1.77384; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:232 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:235 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] AC and DC Candidates: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:236 Expression: isapprox((((result["solution"])["branchdc_ne"])["1"])["pt"], -1.77384; atol = 0.01) Evaluated: isapprox(-1.3737131458180136, -1.77384; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:232 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:236 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] AC and DC Candidates: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:238 Expression: isapprox((((result["solution"])["convdc_ne"])["5"])["pconv"], -1.76543; atol = 0.01) Evaluated: isapprox(-1.364705882353034, -1.76543; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:232 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:238 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 3e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 3e+01] Presolving model 116 rows, 75 cols, 252 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 185 rows, 93 cols, 470 nonzeros 0s 164 rows, 72 cols, 480 nonzeros 0s 107 rows, 67 cols, 353 nonzeros 0s 107 rows, 67 cols, 353 nonzeros 0s Solving MIP model with: 107 rows 67 cols (18 binary, 0 integer, 0 implied int., 49 continuous) 353 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 16.23419662 inf inf 0 0 0 53 0.0s R 0 0 0 0.00% 20.44982397 28.8220988 29.05% 93 7 0 70 0.0s L 0 0 0 0.00% 24.04713404 26.9331482 10.72% 359 22 0 241 0.1s B 3 0 1 25.00% 24.04713404 26.3331482 8.68% 360 22 6 631 0.2s B 8 0 4 75.00% 24.04713404 25.4220988 5.41% 368 22 21 894 0.2s Solving report Status Optimal Primal bound 25.4220988027 Dual bound 25.4220988027 Gap 0% (tolerance: 0.01%) Solution status feasible 25.4220988027 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.17 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 9 LP iterations 945 (total) 480 (strong br.) 110 (separation) 180 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [1e-02, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 35 has infeasibility of 1.6 from [lower, value, upper] = [ -2; -3.6; 2] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] Solution has num max sum Col infeasibilities 2 1.6 3.2 Integer infeasibilities 0 0 0 Row infeasibilities 94 7.473 293 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [1e-02, 6e+00] Presolving model 123 rows, 84 cols, 270 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 188 rows, 101 cols, 479 nonzeros 0s 164 rows, 77 cols, 477 nonzeros 0s 140 rows, 64 cols, 429 nonzeros 0s 92 rows, 64 cols, 301 nonzeros 0s 90 rows, 62 cols, 315 nonzeros 0s Solving MIP model with: 90 rows 62 cols (16 binary, 0 integer, 0 implied int., 46 continuous) 315 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 18.50146576 24.44419761 24.31% 0 0 0 55 0.0s L 0 0 0 0.00% 20.69644923 22.84419761 9.40% 264 23 4 102 0.1s 25.0% inactive integer columns, restarting Model after restart has 59 rows, 49 cols (12 bin., 0 int., 1 impl., 36 cont.), and 193 nonzeros 0 0 0 0.00% 20.70442872 22.84419761 9.37% 8 0 0 224 0.1s 16.7% inactive integer columns, restarting Model after restart has 55 rows, 46 cols (10 bin., 0 int., 0 impl., 36 cont.), and 185 nonzeros 0 0 0 0.00% 20.70442872 22.84419761 9.37% 6 0 0 251 0.1s 0 0 0 0.00% 20.70442872 22.84419761 9.37% 6 6 0 268 0.1s 20.0% inactive integer columns, restarting Model after restart has 40 rows, 38 cols (8 bin., 0 int., 0 impl., 30 cont.), and 118 nonzeros 0 0 0 0.00% 22.12948214 22.84419761 3.13% 6 0 0 318 0.1s 12.5% inactive integer columns, restarting Model after restart has 36 rows, 36 cols (7 bin., 0 int., 0 impl., 29 cont.), and 106 nonzeros 0 0 0 0.00% 22.12948214 22.84419761 3.13% 4 0 0 330 0.1s 0 0 0 0.00% 22.12948214 22.84419761 3.13% 4 4 0 339 0.1s Solving report Status Optimal Primal bound 22.8441976059 Dual bound 22.8441976059 Gap 0% (tolerance: 0.01%) Solution status feasible 22.8441976059 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.17 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 444 (total) 36 (strong br.) 123 (separation) 154 (heuristics) AC and DC Candidates: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:252 Expression: isapprox((((result["solution"])["branchdc_ne"])["3"])["pf"], -3.7276; atol = 0.01) Evaluated: isapprox(-3.9999999999999494, -3.7276; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:232 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:252 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] AC and DC Candidates: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:253 Expression: isapprox((((result["solution"])["branchdc_ne"])["3"])["pt"], 3.7276; atol = 0.01) Evaluated: isapprox(3.9999999999999494, 3.7276; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:232 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:253 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] AC and DC Candidates: Test Failed at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:255 Expression: isapprox((((result["solution"])["convdc_ne"])["6"])["pconv"], 3.74419; atol = 0.01) Evaluated: isapprox(4.016995731692418, 3.74419; atol = 0.01) Stacktrace: [1] top-level scope @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:232 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1833 [inlined] [3] macro expansion @ ~/.julia/packages/PowerModelsACDC/Hfyvm/test/tnep.jl:255 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:730 [inlined] Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [8e-01, 1e+01] RHS [1e-02, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ -0.4; -3.6; -0.4] WARNING: Row 15 has infeasibility of 7.473 from [lower, value, upper] = [ 0; 7.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [8e-01, 1e+01] RHS [1e-02, 2e+00] Presolving model 55 rows, 46 cols, 136 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 77 rows, 57 cols, 202 nonzeros 0s 65 rows, 45 cols, 194 nonzeros 0s 52 rows, 32 cols, 170 nonzeros 0s 27 rows, 28 cols, 92 nonzeros 0s 26 rows, 27 cols, 95 nonzeros 0s Solving MIP model with: 26 rows 27 cols (11 binary, 0 integer, 0 implied int., 16 continuous) 95 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s S 0 0 0 0.00% 0 14.96629641 100.00% 0 0 0 0 0.0s 0 0 0 0.00% 11.01699014 14.96629641 26.39% 0 0 0 15 0.0s L 0 0 0 0.00% 12.8973364 13.36629641 3.51% 68 2 1 21 0.0s Solving report Status Optimal Primal bound 13.3662964088 Dual bound 13.3662964088 Gap 0% (tolerance: 0.01%) Solution status feasible 13.3662964088 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 51 (total) 0 (strong br.) 9 (separation) 27 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+00] Bound [1e+00, 6e+00] RHS [1e+00, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 46 2 50.96 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+00] Bound [1e+00, 6e+00] RHS [1e+00, 6e+00] Presolving model 138 rows, 82 cols, 276 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 200 rows, 89 cols, 496 nonzeros 0s 166 rows, 55 cols, 508 nonzeros 0s 101 rows, 50 cols, 340 nonzeros 0s 101 rows, 50 cols, 340 nonzeros 0s Objective function is integral with scale 5 Solving MIP model with: 101 rows 50 cols (7 binary, 0 integer, 0 implied int., 43 continuous) 340 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 14.3% inactive integer columns, restarting Model after restart has 82 rows, 41 cols (6 bin., 0 int., 0 impl., 35 cont.), and 296 nonzeros 0 0 0 0.00% 7.047647218 inf inf 0 0 0 34 0.0s 0 0 0 0.00% 7.047647218 inf inf 1 0 0 58 0.0s R 0 0 0 0.00% 8.190558635 8.2 0.12% 22 4 0 64 0.0s Solving report Status Optimal Primal bound 8.2 Dual bound 8.2 Gap 0% (tolerance: 0.01%) Solution status feasible 8.2 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 64 (total) 0 (strong br.) 6 (separation) 0 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 294 #IntBinVar: 14 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.5003538131713867 Relaxation Obj: 5.656048594865552 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-06, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 30 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 188 50 4870 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-06, 5e+01] Presolving model 838 rows, 264 cols, 2380 nonzeros 0s 618 rows, 178 cols, 2024 nonzeros 0s 562 rows, 168 cols, 1872 nonzeros 0s Presolve : Reductions: rows 562(-757); columns 168(-154); elements 1872(-1768) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 7.9973488921e+00 Pr: 182(2040.19); Du: 0(1.99661e-12) 0s 130 7.9975796057e+00 0s Model status : Infeasible Simplex iterations: 130 Objective value : 7.9974096035e+00 HiGHS run time : 0.01 Presolving model 1004 rows, 271 cols, 2988 nonzeros 0s 864 rows, 197 cols, 2566 nonzeros 0s 740 rows, 148 cols, 2397 nonzeros 0s 724 rows, 146 cols, 2314 nonzeros 0s Solving MIP model with: 724 rows 146 cols (6 binary, 0 integer, 0 implied int., 140 continuous) 2314 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.815148946 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 2.407598024 inf inf 0 0 0 186 0.0s R 0 0 0 0.00% 3.984898442 3.984905201 0.00% 72 8 0 251 0.1s Solving report Status Optimal Primal bound 3.9849052013 Dual bound 3.98489844157 Gap 0.00017% (tolerance: 0.01%) Solution status feasible 3.9849052013 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.07 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 251 (total) 0 (strong br.) 65 (separation) 0 (heuristics) 3.9849 1.9e-5 0.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 30 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 197 50 4879 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1047 rows, 299 cols, 3114 nonzeros 0s 907 rows, 225 cols, 2692 nonzeros 0s 745 rows, 150 cols, 2411 nonzeros 0s 729 rows, 148 cols, 2328 nonzeros 0s Solving MIP model with: 729 rows 148 cols (6 binary, 0 integer, 0 implied int., 142 continuous) 2328 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00907880698 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.001858053 2.00761552 0.29% 0 0 0 157 0.0s H 0 0 0 0.00% 2.005217786 2.00761552 0.12% 8 1 0 163 0.1s Solving report Status Optimal Primal bound 2.00761551996 Dual bound 2.00761551996 Gap 0% (tolerance: 0.01%) Solution status feasible 2.00761551996 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.07 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 253 (total) 0 (strong br.) 6 (separation) 90 (heuristics) 2.0076 1.4e-5 0.4 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 30 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 204 50 4884 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1090 rows, 327 cols, 3296 nonzeros 0s 949 rows, 253 cols, 2818 nonzeros 0s 748 rows, 152 cols, 2413 nonzeros 0s 732 rows, 150 cols, 2330 nonzeros 0s Solving MIP model with: 732 rows 150 cols (6 binary, 0 integer, 0 implied int., 144 continuous) 2330 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540083724 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129799168 0.0129858172 0.05% 0 0 0 144 0.0s 16.7% inactive integer columns, restarting Solving report Status Optimal Primal bound 0.0129858172103 Dual bound 0.0129858172103 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0129858172103 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.06 (total) 0.03 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 144 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.013 1.4e-5 0.7 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-17, 6.84598e-17] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-16, 1.3692e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-16, 2.0538e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 59 has infeasibility of 0.9 from [lower, value, upper] = [ -0.1; 1; 0.1] WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] WARNING: Row 30 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 211 50 4891 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1133 rows, 355 cols, 3534 nonzeros 0s 961 rows, 251 cols, 2977 nonzeros 0s 748 rows, 152 cols, 2413 nonzeros 0s 732 rows, 150 cols, 2330 nonzeros 0s Solving MIP model with: 732 rows 150 cols (6 binary, 0 integer, 0 implied int., 144 continuous) 2330 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540209548 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129827842 0.0129886871 0.05% 0 0 0 142 0.0s 16.7% inactive integer columns, restarting Solving report Status Optimal Primal bound 0.0129886871223 Dual bound 0.0129886871223 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0129886871223 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.02 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 142 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.7467901706695557 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 5.66 - 5.7 1 - 2 3 - 7.38 - 6.6 - 66.8% 3 3 - 8.24 - 6.9 - 90.2% 3 4 - 8.24 - 7.7 - 6722.9% 3 5 - 8.24 - 8.3 - 82.1% 3 4 - 8.45 - 9.0 - 68.7% 3 5 - 8.95 - 9.5 - 81.4% 0 6 10.2 10.20001 0.0% 9.8 - 83.7% #branches: 8 Obj: 10.200001568113397 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1 from [lower, value, upper] = [ -1; 0; -1] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 46 2 50.96 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 142 rows, 84 cols, 290 nonzeros 0s 45 rows, 29 cols, 108 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 214 rows, 92 cols, 536 nonzeros 0s 181 rows, 59 cols, 542 nonzeros 0s 118 rows, 54 cols, 406 nonzeros 0s 117 rows, 53 cols, 415 nonzeros 0s Solving MIP model with: 117 rows 53 cols (8 binary, 0 integer, 0 implied int., 45 continuous) 415 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -800 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 622.3278939 inf inf 1 0 0 78 0.0s R 0 0 0 0.00% 622.3278939 659.9091248 5.69% 89 4 0 80 0.0s 25.0% inactive integer columns, restarting Model after restart has 79 rows, 42 cols (4 bin., 0 int., 0 impl., 38 cont.), and 260 nonzeros 0 0 0 0.00% 622.3278939 659.9091248 5.69% 2 0 0 87 0.0s 0 0 0 0.00% 622.3278939 659.9091248 5.69% 2 1 0 91 0.0s Solving report Status Optimal Primal bound 659.909124818 Dual bound 659.909124818 Gap 0% (tolerance: 0.01%) Solution status feasible 659.909124818 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 123 (total) 0 (strong br.) 6 (separation) 24 (heuristics) Test Summary: | Pass Fail Total Time PowerModelsACDC | 288 8 296 10m58.6s test ac polar pf | 45 45 2m12.8s test ac rectangular pf | 33 33 11.7s test dc pf | 14 14 7.9s 4-bus ac voltage droop case | 22 22 0.3s test ac polar opf | 7 7 14.8s test ac rectangular opf | 7 7 6.4s test IVR OPF | 4 4 23.1s test dc opf | 8 8 1.5s test soc (BIM) opf | 8 8 22.1s test soc distflow opf_bf | 8 8 19.1s test qc opf | 6 6 21.1s test qc opf with trilinear convexhull relaxation | 6 6 0.9s test dc tnep | 17 2 19 50.4s 6-bus case | 6 2 8 44.7s 9-bus case | 2 2 0.0s 14-bus case | 3 3 3.8s 39-bus case | 6 6 1.9s test AC tnep | 13 13 2m35.1s test LPAC tnep | 15 15 44.8s ACDC tnep | 21 21 42.6s AC and DC Candidates | 21 6 27 5.4s mp-tnep | 19 19 13.3s test sacdc pf | 14 14 1m22.5s RNG of the outermost testset: Random.Xoshiro(0x3fc5122e91a373db, 0x628ccc298112e923, 0xdfed711ff3150898, 0x87f3c886df60507b, 0x7eb927faefe78d99) ERROR: LoadError: Some tests did not pass: 288 passed, 8 failed, 0 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/PowerModelsACDC/Hfyvm/test/runtests.jl:39 Testing failed after 831.14s ERROR: LoadError: Package PowerModelsACDC errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2418 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2273 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:498 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:331 [12] _start() @ Base ./client.jl:564 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1023.96s: package has test failures