Package evaluation of PowerModelsACDC on Julia 1.13.0-DEV.985 (9c94e7ae32*) started at 2025-08-14T19:11:31.176 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.66s ################################################################################ # Installation # Installing PowerModelsACDC... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [ff45984e] + PowerModelsACDC v0.9.1 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.17.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.18.0 [187b0558] + ConstructionBase v1.6.0 ⌅ [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [a0c0ee7d] + DifferentiationInterface v0.7.4 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.5 [6a86dc24] + FiniteDiff v2.28.0 [f6369f11] + ForwardDiff v1.0.1 [2030c09a] + InfrastructureModels v0.7.8 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.28.0 [d3d80556] + LineSearches v7.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.1 [f28f55f0] + Memento v1.4.1 [d8a4904e] + MutableArithmetics v1.6.4 [d41bc354] + NLSolversBase v7.10.0 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [c36e90e8] + PowerModels v0.21.5 [ff45984e] + PowerModelsACDC v0.9.1 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.5.0 [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.1 [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.13.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.13.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.13.1+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.22s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 99.86s ################################################################################ # Testing # Testing PowerModelsACDC Status `/tmp/jl_ANyN3B/Project.toml` ⌅ [87dc4568] HiGHS v1.15.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.6 [4076af6c] JuMP v1.28.0 [2ddba703] Juniper v0.9.3 [f28f55f0] Memento v1.4.1 [2774e3e8] NLsolve v4.5.1 [c36e90e8] PowerModels v0.21.5 [ff45984e] PowerModelsACDC v0.9.1 [37e2e46d] LinearAlgebra v1.13.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_ANyN3B/Manifest.toml` [47edcb42] ADTypes v1.17.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.18.0 [187b0558] ConstructionBase v1.6.0 ⌅ [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.7.4 [b4f34e82] Distances v0.10.12 [ffbed154] DocStringExtensions v0.9.5 [6a86dc24] FiniteDiff v2.28.0 [f6369f11] ForwardDiff v1.0.1 ⌅ [87dc4568] HiGHS v1.15.0 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.6 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.28.0 [2ddba703] Juniper v0.9.3 [d3d80556] LineSearches v7.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.1 [f28f55f0] Memento v1.4.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.10.0 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [c36e90e8] PowerModels v0.21.5 [ff45984e] PowerModelsACDC v0.9.1 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.5.0 [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.1 [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.10.0+0 [e33a78d0] Hwloc_jll v2.12.1+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1701+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.0+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [319450e9] SPRAL_jll v2025.5.20+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.13.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.13.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.15.0+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.7.15 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.2+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.13.1+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... 2012.2 ms ? Memento 13330.1 ms ? InfrastructureModels 13879.2 ms ? PowerModels Info Given PowerModelsACDC was explicitly requested, output will be shown live  WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 13470.2 ms ? PowerModelsACDC WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. Precompiling packages... Info Given Memento was explicitly requested, output will be shown live  WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 1859.2 ms ? Memento WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. Precompiling packages... 1918.1 ms ? Memento 4985.8 ms ✓ NLsolve 11699.1 ms ? InfrastructureModels Info Given PowerModels was explicitly requested, output will be shown live  ┌ Warning: Module Memento with build ID ffffffff-ffff-ffff-3934-29a0e6d1dbb5 is missing from the cache. │ This may mean Memento [f28f55f0-a522-5efc-85c2-fe41dfb9b2d9] does not support precompilation but is imported by a module that does. └ @ Base loading.jl:2632 11268.1 ms ? PowerModels 1 dependency successfully precompiled in 31 seconds. 79 already precompiled. 1 dependency precompiled but a different version is currently loaded. Restart julia to access the new version. Otherwise, loading dependents of this package may trigger further precompilation to work with the unexpected version. 3 dependencies failed but may be precompilable after restarting julia 3 dependencies had output during precompilation: ┌ InfrastructureModels │ ┌ Warning: Module Memento with build ID ffffffff-ffff-ffff-3934-29a0e6d1dbb5 is missing from the cache. │ │ This may mean Memento [f28f55f0-a522-5efc-85c2-fe41dfb9b2d9] does not support precompilation but is imported by a module that does. │ └ @ Base loading.jl:2632 └ ┌ Memento │ WARNING: Method definition var"@test_throws"(LineNumberNode, Module, Any, Any, Any) in module Test at /source/usr/share/julia/stdlib/v1.13/Test/src/Test.jl:868 overwritten in module TestUtils at /home/pkgeval/.julia/packages/Memento/xnHxE/src/memento_test.jl:119. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ ┌ PowerModels │ [Output was shown above] └ ┌ Warning: Module Memento with build ID ffffffff-ffff-ffff-3934-29a0e6d1dbb5 is missing from the cache. │ This may mean Memento [f28f55f0-a522-5efc-85c2-fe41dfb9b2d9] does not support precompilation but is imported by a module that does. └ @ Base loading.jl:2632 Precompiling packages... 1817.4 ms ? Memento Info Given InfrastructureModels was explicitly requested, output will be shown live  ┌ Warning: Module Memento with build ID ffffffff-ffff-ffff-3934-29a0e6d1dbb5 is missing from the cache. │ This may mean Memento [f28f55f0-a522-5efc-85c2-fe41dfb9b2d9] does not support precompilation but is imported by a module that does. └ @ Base loading.jl:2632 11210.6 ms ? InfrastructureModels ┌ Warning: Module Memento with build ID ffffffff-ffff-ffff-3934-29a0e6d1dbb5 is missing from the cache. │ This may mean Memento [f28f55f0-a522-5efc-85c2-fe41dfb9b2d9] does not support precompilation but is imported by a module that does. └ @ Base loading.jl:2632 Precompiling packages... 50343.2 ms ✓ Ipopt → IpoptMathOptInterfaceExt 1 dependency successfully precompiled in 51 seconds. 75 already precompiled. Precompiling packages... 12075.2 ms ✓ Juniper 1 dependency successfully precompiled in 13 seconds. 52 already precompiled. Precompiling packages... 1214.7 ms ✓ HiGHS_jll 37645.5 ms ✓ HiGHS 2 dependencies successfully precompiled in 40 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 ****************************************************************************** [0] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 117 rows; 128 cols; 312 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [1e+03, 1e+06] Bound [4e-01, 6e+00] RHS [1e-02, 4e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -8.7787760697e-02 Ph1: 16(27968.9); Du: 2(8.77878e-05) 0s 79 2.4021711179e+04 Pr: 0(0); Du: 0(1.36424e-12) 0s Model status : Optimal Simplex iterations: 79 Objective value : 2.4021711179e+04 Relative P-D gap : 5.1491452261e-15 HiGHS run time : 0.21 [0] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 155 rows; 151 cols; 383 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e+03, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.4710201279e-03 Pr: 82(4813.43); Du: 3(5.07019e-05) 0s 107 1.9878411151e+04 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 107 Objective value : 1.9878411151e+04 Relative P-D gap : 1.2078762203e-14 HiGHS run time : 0.00 [0] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 141 rows; 151 cols; 369 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [2e+03, 1e+06] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.6189978376e-03 Pr: 75(4808.96); Du: 3(9.0941e-05) 0s 101 1.9844553319e+04 Pr: 0(0); Du: 0(3.63798e-12) 0s Model status : Optimal Simplex iterations: 101 Objective value : 1.9844553319e+04 Relative P-D gap : 1.3382636971e-14 HiGHS run time : 0.00 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 32 rows; 31 cols; 74 nonzeros Coefficient ranges: Matrix [1e+00, 2e+02] Cost [1e+03, 4e+03] Bound [2e-02, 6e+00] RHS [5e-01, 4e+00] Solving LP without presolve, or with basis, or unconstrained Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -1.2739069011e-04 Pr: 6(46.5297); Du: 1(7.14066e-06) 0s 10 1.6565084683e+04 Pr: 0(0) 0s Model status : Optimal Simplex iterations: 10 Objective value : 1.6565084683e+04 Relative P-D gap : 2.1961727796e-16 HiGHS run time : 0.00 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 222 rows; 124 cols; 535 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-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; -3.2; 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 by solving LP for user-supplied values of discrete variables LP has 222 rows; 124 cols; 535 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 122 rows, 73 cols, 250 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 177 rows, 90 cols, 446 nonzeros 0s 156 rows, 69 cols, 464 nonzeros 0s 89 rows, 62 cols, 295 nonzeros 0s 86 rows, 59 cols, 286 nonzeros 0s Solving MIP model with: 86 rows 59 cols (16 binary, 0 integer, 0 implied int., 43 continuous) 286 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 52 0.0s R 0 0 0 0.00% 20.06401564 27.9331482 28.17% 72 2 0 54 0.0s L 0 0 0 0.00% 25.05275479 26.9331482 6.98% 292 34 0 106 0.1s H 0 0 0 0.00% 25.45010228 26.3331482 3.35% 328 38 0 190 0.1s 25.0% inactive integer columns, restarting Model after restart has 65 rows, 45 cols (12 bin., 0 int., 0 impl., 33 cont.), and 228 nonzeros 0 0 0 0.00% 25.64227743 26.3331482 2.62% 14 0 0 304 0.1s R 0 0 0 0.00% 25.64227743 26.3331482 2.62% 14 8 0 328 0.1s 16.7% inactive integer columns, restarting Model after restart has 61 rows, 41 cols (10 bin., 0 int., 0 impl., 31 cont.), and 220 nonzeros 0 0 0 0.00% 25.64227743 26.3331482 2.62% 8 0 0 328 0.1s R 0 0 0 0.00% 25.64227743 26.3331482 2.62% 8 8 0 342 0.1s 20.0% inactive integer columns, restarting Model after restart has 49 rows, 37 cols (8 bin., 0 int., 0 impl., 29 cont.), and 165 nonzeros 0 0 0 0.00% 25.77004173 26.3331482 2.14% 12 0 0 376 0.1s 0 0 0 0.00% 25.77004173 26.3331482 2.14% 12 11 0 390 0.1s B 0 0 0 0.00% 26.14765335 26.3331482 0.70% 151 13 6 480 0.2s 1 0 1 100.00% 26.3331482 26.3331482 0.00% 152 13 8 522 0.2s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) P-D integral 0.00893062648119 Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 5.10702591328e-15 (int. viol.) 0 (row viol.) Timing 0.19 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 522 (total) 37 (strong br.) 135 (separation) 240 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 88 rows; 54 cols; 207 nonzeros; 4 integer variables (4 binary) 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 by solving LP for user-supplied values of discrete variables LP has 88 rows; 54 cols; 207 nonzeros Coefficient ranges: Matrix [1e-02, 2e+01] Cost [1e+00, 5e+00] Bound [1e-01, 2e+01] RHS [9e-01, 6e+00] Presolving model 53 rows, 35 cols, 116 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 71 rows, 39 cols, 176 nonzeros 0s 36 rows, 19 cols, 106 nonzeros 0s 25 rows, 14 cols, 69 nonzeros 0s 17 rows, 12 cols, 51 nonzeros 0s 13 rows, 10 cols, 37 nonzeros 0s 7 rows, 9 cols, 19 nonzeros 0s 7 rows, 9 cols, 19 nonzeros 0s Objective function is integral with scale 10 Solving MIP model with: 7 rows 9 cols (2 binary, 0 integer, 0 implied int., 7 continuous) 19 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 10.7 inf inf 0 0 0 0 0.0s S 0 0 0 100.00% 10.7 10.7 0.00% 0 0 0 0 0.0s 1 0 1 100.00% 10.7 10.7 0.00% 0 0 0 5 0.0s Solving report Status Optimal Primal bound 10.7 Dual bound 10.7 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 10.7 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 5 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 1464 rows; 854 cols; 3533 nonzeros; 227 integer variables (227 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [1e-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] = [ 0; -0.774; 0] WARNING: Row 2 has infeasibility of 2.949 from [lower, value, upper] = [ 0; -2.949; 0] WARNING: Row 57 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 by solving LP for user-supplied values of discrete variables LP has 1464 rows; 854 cols; 3533 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [1e-01, 1e+01] RHS [1e-01, 6e+00] Presolving model 696 rows, 372 cols, 1426 nonzeros 0s 71 rows, 40 cols, 208 nonzeros 0s 54 rows, 30 cols, 162 nonzeros 0s 44 rows, 25 cols, 136 nonzeros 0s 28 rows, 25 cols, 94 nonzeros 0s 18 rows, 16 cols, 68 nonzeros 0s 8 rows, 7 cols, 35 nonzeros 0s Dependent equations search running on 6 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 8 rows, 7 cols, 35 nonzeros 0s Presolve : Reductions: rows 8(-1456); columns 7(-847); elements 35(-3498) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.2499998643e+01 Pr: 8(58.144) 0s 5 6.0424711493e+01 0s Model status : Infeasible Simplex iterations: 5 Objective value : 6.0424691621e+01 HiGHS run time : 0.00 Presolving model 1210 rows, 599 cols, 3030 nonzeros 0s 646 rows, 538 cols, 1989 nonzeros 0s 646 rows, 538 cols, 1989 nonzeros 0s Solving MIP model with: 646 rows 538 cols (227 binary, 0 integer, 0 implied int., 311 continuous) 1989 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 452 0.0s C 0 0 0 0.00% 8.226742078 2485.092099 99.67% 57 13 0 519 0.1s L 0 0 0 0.00% 8.416796516 15.6920988 46.36% 189 46 0 671 0.9s 59.9% inactive integer columns, restarting Model after restart has 361 rows, 259 cols (91 bin., 0 int., 0 impl., 168 cont.), and 1165 nonzeros 0 0 0 0.00% 8.417453351 15.6920988 46.36% 34 0 0 1675 1.0s 0 0 0 0.00% 8.417453351 15.6920988 46.36% 34 25 0 1729 1.0s L 0 0 0 0.00% 8.554427719 15.6920988 45.49% 226 81 0 2143 2.1s 67 0 34 100.00% 15.6920988 15.6920988 0.00% 299 45 596 14017 4.8s Solving report Status Optimal Primal bound 15.6920988029 Dual bound 15.6920988029 Gap 0% (tolerance: 0.01%) P-D integral 2.56933819034 Solution status feasible 15.6920988029 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 4.84 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 5 Nodes 67 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 14017 (total) 5434 (strong br.) 654 (separation) 5696 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 598 rows; 369 cols; 1428 nonzeros; 56 integer variables (56 binary) Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [7e-02, 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] = [ 0; 3.22; 0] 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 by solving LP for user-supplied values of discrete variables LP has 598 rows; 369 cols; 1428 nonzeros Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [7e-02, 5e+01] RHS [7e-02, 1e+01] Presolving model 343 rows, 209 cols, 761 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 493 rows, 265 cols, 1239 nonzeros 0s 394 rows, 199 cols, 1132 nonzeros 0s 225 rows, 180 cols, 738 nonzeros 0s 222 rows, 177 cols, 728 nonzeros 0s Solving MIP model with: 222 rows 177 cols (55 binary, 0 integer, 0 implied int., 122 continuous) 728 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 185 0.0s R 0 0 0 0.00% 20.79458635 29.86054482 30.36% 115 12 0 208 0.0s L 0 0 0 0.00% 23.2046946 25.16054482 7.77% 452 67 4 444 0.3s 7.3% inactive integer columns, restarting Model after restart has 200 rows, 164 cols (51 bin., 0 int., 0 impl., 113 cont.), and 672 nonzeros 0 0 0 0.00% 23.20562282 25.16054482 7.77% 26 0 0 1208 0.6s 0 0 0 0.00% 23.20562282 25.16054482 7.77% 26 22 0 1385 0.6s L 0 0 0 0.00% 23.22982461 25.16054482 7.67% 305 30 0 2365 1.7s 7 0 4 100.00% 25.16054482 25.16054482 0.00% 315 30 49 3986 1.8s Solving report Status Optimal Primal bound 25.1605448204 Dual bound 25.1605448204 Gap 0% (tolerance: 0.01%) P-D integral 0.178281059116 Solution status feasible 25.1605448204 (objective) 0 (bound viol.) 7.17814692651e-14 (int. viol.) 0 (row viol.) Timing 1.76 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 4 Nodes 7 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 3986 (total) 799 (strong br.) 326 (separation) 2360 (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: 186 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 15.307546138763428 Relaxation Obj: 20.983698326676176 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 255 rows; 220 cols; 538 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [1e-07, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 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; -3.2; 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 by solving LP for user-supplied values of discrete variables LP has 255 rows; 220 cols; 538 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [1e-07, 2e+00] Presolving model 161 rows, 119 cols, 226 nonzeros 0s 3 rows, 4 cols, 6 nonzeros 0s Presolve : Reductions: rows 3(-252); columns 4(-216); elements 6(-532) Solving the presolved LP Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 6.7368056311e+00 Relative P-D gap : 2.6367939594e-16 HiGHS run time : 0.00 Presolving model 216 rows, 151 cols, 460 nonzeros 0s 115 rows, 87 cols, 296 nonzeros 0s 98 rows, 66 cols, 230 nonzeros 0s 72 rows, 53 cols, 178 nonzeros 0s 48 rows, 42 cols, 128 nonzeros 0s MIP start solution is feasible, objective value is 6.73680563109 Solving MIP model with: 48 rows 42 cols (11 binary, 0 integer, 5 implied int., 26 continuous) 128 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 2.40635138 6.736805631 64.28% 0 0 0 0 0.0s T 0 0 0 0.00% 2.40635138 2.406355095 0.00% 0 0 0 26 0.0s 1 0 1 100.00% 2.406355095 2.406355095 0.00% 0 0 0 26 0.0s Solving report Status Optimal Primal bound 2.40635509547 Dual bound 2.40635509547 Gap 0% (tolerance: 0.01%) P-D integral 0.00421931090356 Solution status feasible 2.40635509547 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 1 (1 feasible; 3 iterations) LP iterations 26 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 2.4064 0.1063 31.5 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 307 rows; 254 cols; 691 nonzeros; 51 integer variables (51 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 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; -3.2; 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 by solving LP for user-supplied values of discrete variables LP has 307 rows; 254 cols; 691 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 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 276 rows, 185 cols, 629 nonzeros 0s 159 rows, 113 cols, 424 nonzeros 0s 116 rows, 78 cols, 304 nonzeros 0s 76 rows, 52 cols, 200 nonzeros 0s Solving MIP model with: 76 rows 52 cols (16 binary, 0 integer, 0 implied int., 36 continuous) 200 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4599956276 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.9703672881 0.9730207264 0.27% 0 0 0 42 0.0s 31.2% inactive integer columns, restarting 0 0 0 100.00% 0.9730207264 0.9730207264 0.00% 0 73 0 42 0.0s Solving report Status Optimal Primal bound 0.97302072641 Dual bound 0.97302072641 Gap 0% (tolerance: 0.01%) P-D integral 1.70721669055e-05 Solution status feasible 0.97302072641 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 0 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 42 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.973 0.0272 33.4 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 359 rows; 288 cols; 912 nonzeros; 85 integer variables (85 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 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; -3.2; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 78 7.473 121.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 359 rows; 288 cols; 912 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 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 328 rows, 219 cols, 850 nonzeros 0s 216 rows, 151 cols, 654 nonzeros 0s 174 rows, 117 cols, 476 nonzeros 0s 159 rows, 53 cols, 220 nonzeros 0s 55 rows, 41 cols, 129 nonzeros 0s 55 rows, 41 cols, 129 nonzeros 0s Solving MIP model with: 55 rows 41 cols (11 binary, 0 integer, 0 implied int., 30 continuous) 129 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.1974679457 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.20159087 0.2015936354 0.00% 0 0 0 33 0.0s 1 0 1 100.00% 0.20159087 0.2015936354 0.00% 0 0 0 33 0.0s Solving report Status Optimal Primal bound 0.201593635441 Dual bound 0.201590870003 Gap 0.00137% (tolerance: 0.01%) P-D integral 3.04165662008e-09 Solution status feasible 0.201593635441 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 33 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.2016 0.0272 33.8 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 411 rows; 322 cols; 1201 nonzeros; 119 integer variables (119 binary) Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 132 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; -3.2; 0] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 85 7.473 128.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 411 rows; 322 cols; 1201 nonzeros Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [8e-02, 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 380 rows, 253 cols, 1139 nonzeros 0s 265 rows, 183 cols, 926 nonzeros 0s 222 rows, 149 cols, 620 nonzeros 0s 191 rows, 53 cols, 221 nonzeros 0s 55 rows, 41 cols, 129 nonzeros 0s 55 rows, 41 cols, 129 nonzeros 0s Solving MIP model with: 55 rows 41 cols (11 binary, 0 integer, 0 implied int., 30 continuous) 129 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.1974679707 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.2015924018 0.2015951667 0.00% 0 0 0 33 0.0s 1 0 1 100.00% 0.2015924018 0.2015951667 0.00% 0 0 0 33 0.0s Solving report Status Optimal Primal bound 0.201595166735 Dual bound 0.201592401774 Gap 0.00137% (tolerance: 0.01%) P-D integral 7.83134590207e-08 Solution status feasible 0.201595166735 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) 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.01986598968506 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 20.98 - 11.6 4 - 3 3 - 29.84 - 13.0 - 93.8% 4 3 - 31.27 - 13.1 - 77.4% 5 4 - 30.97 - 13.3 - 77.2% 6 5 - 31.14 - 13.3 - 86.6% 7 6 - 31.39 - 13.4 - 26.0% 8 7 - 31.4 - 13.7 - 95.7% 9 4 - 31.62 - 13.8 - 83.8% 6 4 33.27 31.89 4.15% 13.9 - 92.5% 6 5 33.27 31.67 4.81% 14.1 - 98.3% 7 5 33.27 32.08 3.58% 14.2 - 82.3% 8 6 33.27 30.81 7.38% 14.3 - 70.9% 9 7 33.27 30.5 8.32% 14.5 - 87.6% 9 7 33.27 31.24 6.08% 15.0 - 92.8% 8 8 33.27 31.33 5.81% 15.8 - 94.1% 9 6 33.27 32.08 3.58% 16.0 - 91.5% 10 7 33.27 32.13 3.43% 16.1 - 78.3% 10 8 33.27 32.13 3.43% 16.4 - 64.8% 11 4 33.27 32.15 3.35% 16.6 - 89.8% 11 5 33.27 31.41 5.57% 16.8 - 90.8% 11 5 33.27 32.15 3.35% 17.0 - 99.1% 11 6 33.27 32.07 3.6% 17.1 - 98.2% 11 7 33.27 32.07 3.59% 17.3 - 90.0% 11 8 33.27 32.15 3.36% 17.4 - 80.6% 0 5 32.200612 32.200613 0.0% 17.4 - 99.8% #branches: 25 Obj: 32.20061233634313 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: 103 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.26173901557922363 Relaxation Obj: 1.4678142298092869 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 98 rows; 111 cols; 200 nonzeros; 4 integer variables (4 binary) 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 85 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 by solving LP for user-supplied values of discrete variables LP has 98 rows; 111 cols; 200 nonzeros Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [4e-06, 1e+00] Presolving model 42 rows, 39 cols, 54 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-98); columns 0(-111); elements 0(-200) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 1.9552835781e+00 Relative P-D gap : 1.1356133065e-16 HiGHS run time : 0.00 Presolving model 70 rows, 51 cols, 142 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 Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 1 0 1 100.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%) P-D integral 0.00055160892189 Solution status feasible 1.12932752045 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) 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.5 FP: 1.467885971069336 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.5 - 87.4% #branches: 2 Obj: 10.700000447069845 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: 238 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.5575580596923828 Relaxation Obj: 15.877095198260463 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 911 rows; 272 cols; 2503 nonzeros; 17 integer variables (17 binary) 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 150 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; -3.2; 0] WARNING: Row 81 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 by solving LP for user-supplied values of discrete variables LP has 911 rows; 272 cols; 2503 nonzeros Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [2e-07, 1e+02] Presolving model 620 rows, 229 cols, 1630 nonzeros 0s 331 rows, 113 cols, 1196 nonzeros 0s Dependent equations search running on 67 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 310 rows, 113 cols, 1106 nonzeros 0s Presolve : Reductions: rows 310(-601); columns 113(-159); elements 1106(-1397) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.8657341330e+00 Pr: 111(1081.59) 0s 108 5.8659692581e+00 0s Model status : Infeasible Simplex iterations: 108 Objective value : 5.8657669859e+00 HiGHS run time : 0.01 Presolving model 736 rows, 246 cols, 2162 nonzeros 0s 646 rows, 156 cols, 2240 nonzeros 0s 554 rows, 135 cols, 1932 nonzeros 0s Solving MIP model with: 554 rows 135 cols (16 binary, 0 integer, 1 implied int., 118 continuous) 1932 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.078975285 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 3.078975285 inf inf 1 0 0 136 0.0s R 0 0 0 0.00% 3.784401119 4.87294543 22.34% 156 9 2 187 0.1s L 0 0 0 0.00% 3.934909783 4.360248571 9.75% 175 10 2 208 0.2s 43.8% inactive integer columns, restarting Model after restart has 418 rows, 105 cols (9 bin., 0 int., 0 impl., 96 cont.), and 1500 nonzeros 0 0 0 0.00% 3.950380214 4.360248571 9.40% 6 0 0 349 0.2s 0 0 0 0.00% 3.950380214 4.360248571 9.40% 6 6 2 386 0.2s 1 0 1 100.00% 4.360242714 4.360248571 0.00% 6 6 2 435 0.2s Solving report Status Optimal Primal bound 4.3602485711 Dual bound 4.36024271443 Gap 0.000134% (tolerance: 0.01%) P-D integral 0.0196483558341 Solution status feasible 4.3602485711 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.21 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 4 (4 feasible; 113 iterations) LP iterations 435 (total) 0 (strong br.) 149 (separation) 112 (heuristics) 4.3602 1.6e-5 0.3 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 963 rows; 306 cols; 2656 nonzeros; 51 integer variables (51 binary) 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 150 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; -3.2; 0] WARNING: Row 81 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 by solving LP for user-supplied values of discrete variables LP has 963 rows; 306 cols; 2656 nonzeros 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 792 rows, 280 cols, 2323 nonzeros 0s 701 rows, 190 cols, 2398 nonzeros 0s 580 rows, 147 cols, 1994 nonzeros 0s Solving MIP model with: 580 rows 147 cols (16 binary, 0 integer, 0 implied int., 131 continuous) 1994 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00427038982 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.000757534 1.012097271 1.12% 0 0 0 217 0.0s 1 0 1 100.00% 1.012097271 1.012097271 0.00% 53 16 0 240 0.1s Solving report Status Optimal Primal bound 1.01209727125 Dual bound 1.01209727125 Gap 0% (tolerance: 0.01%) P-D integral 0.00017003391289 Solution status feasible 1.01209727125 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.06 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 240 (total) 0 (strong br.) 23 (separation) 0 (heuristics) 1.0121 1.3e-5 0.7 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 1015 rows; 340 cols; 2877 nonzeros; 85 integer variables (85 binary) 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 150 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; -3.2; 0] WARNING: Row 81 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 by solving LP for user-supplied values of discrete variables LP has 1015 rows; 340 cols; 2877 nonzeros 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 844 rows, 314 cols, 2544 nonzeros 0s 753 rows, 224 cols, 2619 nonzeros 0s 668 rows, 149 cols, 2028 nonzeros 0s 581 rows, 148 cols, 1982 nonzeros 0s Solving MIP model with: 581 rows 148 cols (16 binary, 0 integer, 0 implied int., 132 continuous) 1982 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283896 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.014499246 0.0145090248 0.07% 0 0 0 169 0.0s 1 0 1 100.00% 0.0145090248 0.0145090248 0.00% 0 0 0 187 0.0s Solving report Status Optimal Primal bound 0.0145090247924 Dual bound 0.0145090247924 Gap 0% (tolerance: 0.01%) P-D integral 5.76570138311e-06 Solution status feasible 0.0145090247924 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 187 (total) 0 (strong br.) 18 (separation) 0 (heuristics) 0.0145 1.3e-5 0.9 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 1067 rows; 374 cols; 3166 nonzeros; 119 integer variables (119 binary) 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 150 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; -3.2; 0] WARNING: Row 81 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 by solving LP for user-supplied values of discrete variables LP has 1067 rows; 374 cols; 3166 nonzeros 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 896 rows, 348 cols, 2833 nonzeros 0s 771 rows, 245 cols, 2834 nonzeros 0s 700 rows, 149 cols, 2029 nonzeros 0s 581 rows, 148 cols, 1982 nonzeros 0s Solving MIP model with: 581 rows 148 cols (16 binary, 0 integer, 0 implied int., 132 continuous) 1982 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283773 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992439 0.0145090227 0.07% 0 0 0 169 0.0s 1 0 1 100.00% 0.0145090227 0.0145090227 0.00% 0 0 0 187 0.0s Solving report Status Optimal Primal bound 0.0145090226945 Dual bound 0.0145090226945 Gap 0% (tolerance: 0.01%) P-D integral 3.10821753566e-06 Solution status feasible 0.0145090226945 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 187 (total) 0 (strong br.) 18 (separation) 0 (heuristics) 0.0145 1.3e-5 1.0 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 1119 rows; 408 cols; 3523 nonzeros; 153 integer variables (153 binary) 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 150 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; -3.2; 0] WARNING: Row 81 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 by solving LP for user-supplied values of discrete variables LP has 1119 rows; 408 cols; 3523 nonzeros 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 948 rows, 382 cols, 3190 nonzeros 0s 820 rows, 277 cols, 3170 nonzeros 0s 732 rows, 149 cols, 2029 nonzeros 0s 581 rows, 148 cols, 1982 nonzeros 0s Solving MIP model with: 581 rows 148 cols (16 binary, 0 integer, 0 implied int., 132 continuous) 1982 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283773 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992439 0.0145090227 0.07% 0 0 0 169 0.0s 1 0 1 100.00% 0.0145090227 0.0145090227 0.00% 0 0 0 187 0.0s Solving report Status Optimal Primal bound 0.0145090226945 Dual bound 0.0145090226945 Gap 0% (tolerance: 0.01%) P-D integral 4.18242702881e-06 Solution status feasible 0.0145090226945 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 187 (total) 0 (strong br.) 18 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 1.0730421543121338 s FP: 5 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 15.88 - 7.7 4 - 3 3 - 28.7 - 8.0 - 61.3% 4 4 - 28.9 - 8.2 - 75.3% 5 5 - 29.14 - 8.5 - 85.8% 6 5 - 29.49 - 8.8 - 75.9% 7 6 - 29.49 - 9.1 - 83.0% 8 6 - 29.53 - 9.3 - 81.2% 9 4 - 29.78 - 9.6 - 89.1% 10 5 - 29.88 - 9.8 - 73.4% 11 7 - 30.04 - 10.1 - 79.6% 12 6 - 30.08 - 10.3 - 80.8% 13 7 - 30.17 - 10.6 - 72.8% 14 7 - 30.18 - 10.9 - 83.9% 15 8 - 30.27 - 11.3 - 87.4% 5 9 31.08 30.27 2.61% 12.3 - 92.8% 4 7 31.08 30.3 2.5% 13.1 - 92.3% 4 7 31.08 30.33 2.41% 13.5 - 93.0% 4 3 31.08 30.36 2.31% 13.8 - 80.7% 4 4 31.08 30.36 2.31% 14.1 - 89.5% 4 8 31.08 30.43 2.09% 14.4 - 88.5% 4 9 31.08 30.43 2.09% 14.6 - 96.9% 4 10 31.08 30.61 1.53% 15.0 - 83.2% 3 11 31.08 30.69 1.25% 16.3 - ∞ 3 8 31.08 30.71 1.18% 16.7 - 92.0% 2 9 31.08 30.71 1.18% 17.1 - 95.2% 2 5 31.08 30.8 0.91% 17.4 - 18.0% 2 8 31.08 30.84 0.76% 17.6 - 78.2% 1 9 31.08 30.84 0.76% 17.9 - 93.5% 1 6 31.08 30.85 0.75% 18.2 - 91.8% 1 7 31.08 30.85 0.75% 18.5 - 72.2% 0 8 31.08 30.85 0.75% 18.8 - 91.7% #branches: 31 Obj: 31.08148341691701 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: 123 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.1872398853302002 Relaxation Obj: 0.6346232363439599 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 324 rows; 131 cols; 927 nonzeros; 4 integer variables (4 binary) 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 97 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 68 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 by solving LP for user-supplied values of discrete variables LP has 324 rows; 131 cols; 927 nonzeros Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [6e-06, 1e+02] Presolving model 207 rows, 107 cols, 637 nonzeros 0s 135 rows, 68 cols, 518 nonzeros 0s Dependent equations search running on 37 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 123 rows, 62 cols, 494 nonzeros 0s Presolve : Reductions: rows 123(-201); columns 62(-69); elements 494(-433) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 2.0887682620e+00 Pr: 55(173.939) 0s 43 2.0887902167e+00 0s Model status : Infeasible Simplex iterations: 43 Objective value : 2.0887615137e+00 HiGHS run time : 0.00 Presolving model 256 rows, 111 cols, 804 nonzeros 0s 192 rows, 78 cols, 682 nonzeros 0s 174 rows, 70 cols, 612 nonzeros 0s Solving MIP model with: 174 rows 70 cols (3 binary, 0 integer, 0 implied int., 67 continuous) 612 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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.358847631 inf inf 0 0 0 75 0.0s R 0 0 0 0.00% 2.200141205 2.733727506 19.52% 10 1 0 91 0.0s 1 0 1 100.00% 2.733727506 2.733727506 0.00% 3 1 5 91 0.0s Solving report Status Optimal Primal bound 2.73372750646 Dual bound 2.73372750646 Gap 0% (tolerance: 0.01%) P-D integral 7.71102396629e-05 Solution status feasible 2.73372750646 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 91 (total) 0 (strong br.) 16 (separation) 0 (heuristics) 2.7337 3.0e-6 0.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 337 rows; 139 cols; 963 nonzeros; 12 integer variables (12 binary) 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 97 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 68 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 by solving LP for user-supplied values of discrete variables LP has 337 rows; 139 cols; 963 nonzeros 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 269 rows, 119 cols, 840 nonzeros 0s 202 rows, 84 cols, 709 nonzeros 0s 175 rows, 69 cols, 615 nonzeros 0s Solving MIP model with: 175 rows 69 cols (3 binary, 0 integer, 0 implied int., 66 continuous) 615 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00189701041 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.9996340745 1.001196923 0.16% 0 0 0 55 0.0s 1 0 1 100.00% 1.001196923 1.001196923 0.00% 3 2 0 57 0.0s Solving report Status Optimal Primal bound 1.00119692337 Dual bound 1.00119692337 Gap 0% (tolerance: 0.01%) P-D integral 1.42636628795e-05 Solution status feasible 1.00119692337 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 57 (total) 0 (strong br.) 2 (separation) 0 (heuristics) 1.0012 5.0e-6 0.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 350 rows; 147 cols; 1015 nonzeros; 20 integer variables (20 binary) 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 97 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 68 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 by solving LP for user-supplied values of discrete variables LP has 350 rows; 147 cols; 1015 nonzeros 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 282 rows, 127 cols, 892 nonzeros 0s 212 rows, 90 cols, 748 nonzeros 0s 171 rows, 68 cols, 606 nonzeros 0s 170 rows, 67 cols, 604 nonzeros 0s Solving MIP model with: 170 rows 67 cols (3 binary, 0 integer, 0 implied int., 64 continuous) 604 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00428387461 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0.00428387461 0.00428387461 0.00% 0 0 0 64 0.0s 1 0 1 100.00% 0.00428387461 0.00428387461 0.00% 0 0 0 64 0.0s Solving report Status Optimal Primal bound 0.00428387460544 Dual bound 0.00428387460544 Gap 0% (tolerance: 0.01%) P-D integral 3.36134024209e-18 Solution status feasible 0.00428387460544 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 64 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0043 4.0e-6 0.2 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 363 rows; 155 cols; 1083 nonzeros; 28 integer variables (28 binary) 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 97 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 68 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 by solving LP for user-supplied values of discrete variables LP has 363 rows; 155 cols; 1083 nonzeros 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 295 rows, 135 cols, 960 nonzeros 0s 222 rows, 96 cols, 799 nonzeros 0s 171 rows, 68 cols, 606 nonzeros 0s 170 rows, 67 cols, 604 nonzeros 0s Solving MIP model with: 170 rows 67 cols (3 binary, 0 integer, 0 implied int., 64 continuous) 604 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00408152309 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0.00408152309 0.00408152309 0.00% 0 0 0 64 0.0s 1 0 1 100.00% 0.00408152309 0.00408152309 0.00% 0 0 0 64 0.0s Solving report Status Optimal Primal bound 0.0040815230871 Dual bound 0.0040815230871 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 0.0040815230871 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 64 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.22842907905578613 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.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 138 rows; 81 cols; 337 nonzeros; 8 integer variables (8 binary) 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] = [ 0; 1; 0] 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 by solving LP for user-supplied values of discrete variables LP has 138 rows; 81 cols; 337 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 72 rows, 42 cols, 146 nonzeros 0s 24 rows, 15 cols, 57 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 91 rows, 34 cols, 273 nonzeros 0s 60 rows, 31 cols, 207 nonzeros 0s 59 rows, 30 cols, 212 nonzeros 0s Solving MIP model with: 59 rows 30 cols (8 binary, 0 integer, 0 implied int., 22 continuous) 212 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 R 0 0 0 0.00% 320.8523953 354.9545624 9.61% 56 6 0 46 0.0s L 0 0 0 0.00% 320.8523953 329.9545624 2.76% 56 6 0 46 0.0s 1 0 1 100.00% 329.9545624 329.9545624 0.00% 64 7 0 58 0.0s Solving report Status Optimal Primal bound 329.954562409 Dual bound 329.954562409 Gap 0% (tolerance: 0.01%) P-D integral 0.0012954149249 Solution status feasible 329.954562409 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 58 (total) 0 (strong br.) 17 (separation) 4 (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: 131 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.44013500213623047 Relaxation Obj: 333.01469191472864 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 143 rows; 147 cols; 293 nonzeros; 8 integer variables (8 binary) Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [7e-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] = [ 0; 1; 0] 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 by solving LP for user-supplied values of discrete variables LP has 143 rows; 147 cols; 293 nonzeros Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [7e-09, 2e+00] Presolving model 72 rows, 54 cols, 98 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(-143); columns 0(-147); elements 0(-293) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.7375769779e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 115 rows, 70 cols, 237 nonzeros 0s 66 rows, 39 cols, 154 nonzeros 0s 48 rows, 29 cols, 106 nonzeros 0s 32 rows, 21 cols, 74 nonzeros 0s 22 rows, 16 cols, 50 nonzeros 0s MIP start solution is feasible, objective value is 3.73757697793 Solving MIP model with: 22 rows 16 cols (6 binary, 0 integer, 3 implied int., 7 continuous) 50 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.7375769779 3.737576978 80.27% 0 0 0 0 0.0s T 0 0 0 0.00% 0.7375769779 0.7375782006 0.00% 0 0 0 9 0.0s 1 0 1 100.00% 0.7375782006 0.7375782006 0.00% 0 0 0 9 0.0s Solving report Status Optimal Primal bound 0.737578200595 Dual bound 0.737578200595 Gap 0% (tolerance: 0.01%) P-D integral 0.00105941790256 Solution status feasible 0.737578200595 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 1 (1 feasible; 0 iterations) LP iterations 9 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.7376 1.8282 1.2 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 168 rows; 163 cols; 365 nonzeros; 24 integer variables (24 binary) Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [5e-02, 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] = [ 0; 1; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 25 2 21.12 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 168 rows; 163 cols; 365 nonzeros Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [5e-02, 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 92 rows, 55 cols, 226 nonzeros 0s 73 rows, 44 cols, 174 nonzeros 0s 57 rows, 36 cols, 142 nonzeros 0s 51 rows, 23 cols, 87 nonzeros 0s 14 rows, 10 cols, 32 nonzeros 0s 12 rows, 9 cols, 28 nonzeros 0s Solving MIP model with: 12 rows 9 cols (4 binary, 0 integer, 0 implied int., 5 continuous) 28 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.049168337 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 1.049168337 1.049168337 0.00% 0 0 0 5 0.0s 1 0 1 100.00% 1.049168337 1.049168337 0.00% 0 0 0 5 0.0s Solving report Status Optimal Primal bound 1.04916833712 Dual bound 1.04916833712 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 1.04916833712 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 5 (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.0492 - 7.0 FP: 7.041795969009399 s FP: 2 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 333.01 - 0.5 0 - 1 3 348.02 343.77 1.22% 0.6 - 74.2% 0 4 348.02 344.32 1.06% 0.7 - 45.1% #branches: 3 Obj: 348.0219280921732 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: 162 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.35381007194519043 Relaxation Obj: 313.63100257663666 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 663 rows; 178 cols; 1816 nonzeros; 8 integer variables (8 binary) Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-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] = [ 0; 1; 0] WARNING: Row 37 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 by solving LP for user-supplied values of discrete variables LP has 663 rows; 178 cols; 1816 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-08, 5e+01] Presolving model 411 rows, 141 cols, 1157 nonzeros 0s 297 rows, 92 cols, 968 nonzeros 0s Dependent equations search running on 49 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 260 rows, 83 cols, 871 nonzeros 0s Presolve : Reductions: rows 260(-403); columns 83(-95); elements 871(-945) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 4.0741245071e+00 Pr: 90(849.449); Du: 0(4.01042e-12) 0s 74 4.0742224803e+00 0s Model status : Infeasible Simplex iterations: 74 Objective value : 4.0741474752e+00 HiGHS run time : 0.00 Presolving model 501 rows, 149 cols, 1482 nonzeros 0s 452 rows, 100 cols, 1454 nonzeros 0s 366 rows, 82 cols, 1216 nonzeros 0s Solving MIP model with: 366 rows 82 cols (8 binary, 0 integer, 2 implied int., 72 continuous) 1216 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.5062481748 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 0.7347061741 inf inf 0 0 6 79 0.0s R 0 0 0 0.00% 1.191044828 1.531641504 22.24% 75 1 6 98 0.0s 62.5% inactive integer columns, restarting Model after restart has 206 rows, 53 cols (3 bin., 0 int., 0 impl., 50 cont.), and 709 nonzeros 0 0 0 0.00% 1.191044828 1.531641504 22.24% 1 0 0 101 0.1s 0 0 0 0.00% 1.230010085 1.531641504 19.69% 1 1 2 117 0.1s 1 0 1 100.00% 1.531641504 1.531641504 0.00% 1 1 2 117 0.1s Solving report Status Optimal Primal bound 1.53164150354 Dual bound 1.53164150354 Gap 0% (tolerance: 0.01%) P-D integral 0.0031308189831 Solution status feasible 1.53164150354 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 117 (total) 0 (strong br.) 19 (separation) 3 (heuristics) 1.5316 1.2e-5 0.1 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 688 rows; 194 cols; 1888 nonzeros; 24 integer variables (24 binary) 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] = [ 0; 1; 0] WARNING: Row 37 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 by solving LP for user-supplied values of discrete variables LP has 688 rows; 194 cols; 1888 nonzeros 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 477 rows, 112 cols, 1537 nonzeros 0s 371 rows, 82 cols, 1240 nonzeros 0s 357 rows, 82 cols, 1206 nonzeros 0s Solving MIP model with: 357 rows 82 cols (8 binary, 0 integer, 0 implied int., 74 continuous) 1206 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00528048082 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.001715419 1.005593776 0.39% 0 0 0 96 0.0s 1 0 1 100.00% 1.005593776 1.005593776 0.00% 8 3 1 138 0.0s Solving report Status Optimal Primal bound 1.00559377597 Dual bound 1.00559377597 Gap 0% (tolerance: 0.01%) P-D integral 3.73004075677e-05 Solution status feasible 1.00559377597 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 138 (total) 0 (strong br.) 5 (separation) 37 (heuristics) 1.0056 1.0e-5 0.2 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 713 rows; 210 cols; 1992 nonzeros; 40 integer variables (40 binary) 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] = [ 0; 1; 0] WARNING: Row 37 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 by solving LP for user-supplied values of discrete variables LP has 713 rows; 210 cols; 1992 nonzeros 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, 1436 nonzeros 0s 372 rows, 83 cols, 1236 nonzeros 0s 358 rows, 83 cols, 1202 nonzeros 0s Solving MIP model with: 358 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1202 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0034717667 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819361426 0.00819738351 0.05% 0 0 0 87 0.0s 25.0% inactive integer columns, restarting 0 0 0 100.00% 0.00819738351 0.00819738351 0.00% 0 211 0 87 0.0s Solving report Status Optimal Primal bound 0.00819738350593 Dual bound 0.00819738350593 Gap 0% (tolerance: 0.01%) P-D integral 1.36058467395e-06 Solution status feasible 0.00819738350593 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 0 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 87 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0082 1.0e-5 0.3 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 738 rows; 226 cols; 2128 nonzeros; 56 integer variables (56 binary) 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] = [ 0; 1; 0] WARNING: Row 37 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 by solving LP for user-supplied values of discrete variables LP has 738 rows; 226 cols; 2128 nonzeros 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, 1508 nonzeros 0s 372 rows, 83 cols, 1236 nonzeros 0s 358 rows, 83 cols, 1202 nonzeros 0s Solving MIP model with: 358 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1202 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00347179352 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819367374 0.00819744303 0.05% 0 0 0 87 0.0s 25.0% inactive integer columns, restarting 0 0 0 100.00% 0.00819744303 0.00819744303 0.00% 0 211 0 87 0.0s Solving report Status Optimal Primal bound 0.00819744303134 Dual bound 0.00819744303134 Gap 0% (tolerance: 0.01%) P-D integral 2.89845523276e-06 Solution status feasible 0.00819744303134 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 0 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 87 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.32846999168395996 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 313.63 - 1.3 0 - 3 3 - 317.71 - 1.6 - 71.7% 1 4 342.07 329.96 3.54% 2.1 - 63.9% 0 5 333.1 331.65 0.44% 2.5 - 44.4% #branches: 4 Obj: 333.09519616504946 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 222 rows; 124 cols; 535 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-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; -3.2; 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 by solving LP for user-supplied values of discrete variables LP has 222 rows; 124 cols; 535 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 122 rows, 73 cols, 250 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 177 rows, 90 cols, 446 nonzeros 0s 156 rows, 69 cols, 464 nonzeros 0s 89 rows, 62 cols, 295 nonzeros 0s 86 rows, 59 cols, 286 nonzeros 0s Solving MIP model with: 86 rows 59 cols (16 binary, 0 integer, 0 implied int., 43 continuous) 286 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 52 0.0s R 0 0 0 0.00% 20.06401564 27.9331482 28.17% 72 2 0 54 0.0s L 0 0 0 0.00% 25.05275479 26.9331482 6.98% 292 34 0 106 0.1s H 0 0 0 0.00% 25.45010228 26.3331482 3.35% 328 38 0 190 0.1s 25.0% inactive integer columns, restarting Model after restart has 65 rows, 45 cols (12 bin., 0 int., 0 impl., 33 cont.), and 228 nonzeros 0 0 0 0.00% 25.64227743 26.3331482 2.62% 14 0 0 304 0.1s R 0 0 0 0.00% 25.64227743 26.3331482 2.62% 14 8 0 328 0.1s 16.7% inactive integer columns, restarting Model after restart has 61 rows, 41 cols (10 bin., 0 int., 0 impl., 31 cont.), and 220 nonzeros 0 0 0 0.00% 25.64227743 26.3331482 2.62% 8 0 0 328 0.1s R 0 0 0 0.00% 25.64227743 26.3331482 2.62% 8 8 0 342 0.1s 20.0% inactive integer columns, restarting Model after restart has 49 rows, 37 cols (8 bin., 0 int., 0 impl., 29 cont.), and 165 nonzeros 0 0 0 0.00% 25.77004173 26.3331482 2.14% 12 0 0 376 0.1s 0 0 0 0.00% 25.77004173 26.3331482 2.14% 12 11 0 390 0.1s B 0 0 0 0.00% 26.14765335 26.3331482 0.70% 151 13 6 480 0.2s 1 0 1 100.00% 26.3331482 26.3331482 0.00% 152 13 8 522 0.2s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) P-D integral 0.0084295041415 Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 5.10702591328e-15 (int. viol.) 0 (row viol.) Timing 0.19 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 522 (total) 37 (strong br.) 135 (separation) 240 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 228 rows; 126 cols; 555 nonzeros; 18 integer variables (18 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-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; -3.2; 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 by solving LP for user-supplied values of discrete variables LP has 228 rows; 126 cols; 555 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 3e+01] Presolving model 126 rows, 75 cols, 262 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 163 rows, 71 cols, 488 nonzeros 0s 103 rows, 67 cols, 343 nonzeros 0s 103 rows, 67 cols, 343 nonzeros 0s Solving MIP model with: 103 rows 67 cols (18 binary, 0 integer, 0 implied int., 49 continuous) 343 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 52 0.0s R 0 0 0 0.00% 19.68278162 27.9331482 29.54% 247 13 3 76 0.0s L 0 0 0 0.00% 22.93102885 25.4220988 9.80% 301 19 3 97 0.1s 16.7% inactive integer columns, restarting Model after restart has 93 rows, 60 cols (15 bin., 0 int., 0 impl., 45 cont.), and 322 nonzeros 0 0 0 0.00% 23.27653302 25.4220988 8.44% 13 0 0 254 0.2s 0 0 0 0.00% 23.27653302 25.4220988 8.44% 13 8 0 296 0.2s 13.3% inactive integer columns, restarting Model after restart has 88 rows, 55 cols (13 bin., 0 int., 0 impl., 42 cont.), and 315 nonzeros 0 0 0 0.00% 24.55279865 25.4220988 3.42% 17 0 0 354 0.2s 15.4% inactive integer columns, restarting Model after restart has 65 rows, 45 cols (10 bin., 0 int., 0 impl., 35 cont.), and 232 nonzeros 0 0 0 0.00% 24.55279865 25.4220988 3.42% 14 0 0 379 0.2s 0 0 0 0.00% 24.63091178 25.4220988 3.11% 14 13 0 404 0.2s 30.0% inactive integer columns, restarting Model after restart has 62 rows, 41 cols (7 bin., 0 int., 0 impl., 34 cont.), and 216 nonzeros 0 0 0 0.00% 25.16194256 25.4220988 1.02% 15 0 0 588 0.3s 0 0 0 0.00% 25.16194256 25.4220988 1.02% 15 15 0 612 0.3s 1 0 1 100.00% 25.4220988 25.4220988 0.00% 31 16 2 631 0.3s Solving report Status Optimal Primal bound 25.4220988029 Dual bound 25.4220988029 Gap 0% (tolerance: 0.01%) P-D integral 0.020673086397 Solution status feasible 25.4220988029 (objective) 0 (bound viol.) 4.54747350886e-13 (int. viol.) 0 (row viol.) Timing 0.29 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 631 (total) 0 (strong br.) 141 (separation) 319 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 235 rows; 140 cols; 575 nonzeros; 17 integer variables (17 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-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; -3.2; 0] 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 by solving LP for user-supplied values of discrete variables LP has 235 rows; 140 cols; 575 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [1e-02, 6e+00] Presolving model 130 rows, 84 cols, 277 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 189 rows, 101 cols, 481 nonzeros 0s 163 rows, 76 cols, 483 nonzeros 0s 105 rows, 69 cols, 348 nonzeros 0s 104 rows, 68 cols, 356 nonzeros 0s Solving MIP model with: 104 rows 68 cols (17 binary, 0 integer, 0 implied int., 51 continuous) 356 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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% 14.48590227 inf inf 0 0 0 58 0.0s R 0 0 0 0.00% 19.30108503 29.44419761 34.45% 73 7 0 80 0.0s L 0 0 0 0.00% 20.15818839 22.84419761 11.76% 342 36 0 132 0.1s 5.9% inactive integer columns, restarting Model after restart has 92 rows, 61 cols (16 bin., 0 int., 0 impl., 45 cont.), and 321 nonzeros 0 0 0 0.00% 20.15818839 22.84419761 11.76% 11 0 0 216 0.1s 0 0 0 0.00% 20.15818839 22.84419761 11.76% 11 6 0 248 0.1s 6.2% inactive integer columns, restarting Model after restart has 80 rows, 57 cols (15 bin., 0 int., 0 impl., 42 cont.), and 286 nonzeros 0 0 0 0.00% 20.6056622 22.84419761 9.80% 13 0 0 368 0.2s 0 0 0 0.00% 20.6056622 22.84419761 9.80% 13 13 0 402 0.2s B 0 0 0 0.00% 21.2333271 22.84419761 7.05% 231 11 6 722 0.4s 1 0 1 100.00% 22.84419761 22.84419761 0.00% 234 11 8 836 0.4s Solving report Status Optimal Primal bound 22.8441976059 Dual bound 22.8441976059 Gap 0% (tolerance: 0.01%) P-D integral 0.0429523331806 Solution status feasible 22.8441976059 (objective) 0 (bound viol.) 9.66116076029e-13 (int. viol.) 0 (row viol.) Timing 0.39 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 836 (total) 82 (strong br.) 214 (separation) 384 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 126 rows; 100 cols; 301 nonzeros; 11 integer variables (11 binary) Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [4e-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; -3.2; 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 by solving LP for user-supplied values of discrete variables LP has 126 rows; 100 cols; 301 nonzeros Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [4e-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 62 rows, 42 cols, 188 nonzeros 0s 51 rows, 31 cols, 168 nonzeros 0s 27 rows, 28 cols, 96 nonzeros 0s 26 rows, 27 cols, 96 nonzeros 0s Solving MIP model with: 26 rows 27 cols (11 binary, 0 integer, 0 implied int., 16 continuous) 96 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4552470073 inf inf 0 0 0 0 0.0s S 0 0 0 0.00% 0.4552470073 14.96629641 96.96% 0 0 0 0 0.0s 0 0 0 0.00% 11.01699014 14.96629641 26.39% 0 0 0 16 0.0s L 0 0 0 0.00% 11.36682792 13.96629641 18.61% 31 2 2 19 0.0s 36.4% inactive integer columns, restarting Model after restart has 20 rows, 21 cols (7 bin., 0 int., 0 impl., 14 cont.), and 73 nonzeros 0 0 0 0.00% 12.03642211 13.96629641 13.82% 4 0 0 35 0.0s 0 0 0 0.00% 12.03642211 13.96629641 13.82% 4 4 0 42 0.0s H 0 0 0 0.00% 12.73943612 13.36629641 4.69% 115 11 0 60 0.0s 57.1% inactive integer columns, restarting 0 0 0 100.00% 13.36629641 13.36629641 0.00% 2 18 0 89 0.1s Solving report Status Optimal Primal bound 13.3662964088 Dual bound 13.3662964088 Gap 0% (tolerance: 0.01%) P-D integral 0.00734467435381 Solution status feasible 13.3662964088 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.06 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 0 Repair LPs 3 (3 feasible; 8 iterations) LP iterations 89 (total) 0 (strong br.) 29 (separation) 34 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 271 rows; 158 cols; 652 nonzeros; 14 integer variables (14 binary) 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] = [ 0; 1; 0] 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 by solving LP for user-supplied values of discrete variables LP has 271 rows; 158 cols; 652 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+00] Bound [1e+00, 6e+00] RHS [1e+00, 6e+00] Presolving model 144 rows, 84 cols, 284 nonzeros 0s 32 rows, 22 cols, 80 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 204 rows, 91 cols, 504 nonzeros 0s 168 rows, 57 cols, 508 nonzeros 0s 103 rows, 50 cols, 348 nonzeros 0s 102 rows, 49 cols, 357 nonzeros 0s Objective function is integral with scale 5 Solving MIP model with: 102 rows 49 cols (7 binary, 0 integer, 0 implied int., 42 continuous) 357 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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% 6.243037666 inf inf 0 0 0 32 0.0s S 0 0 0 100.00% 6.243037666 8.2 23.87% 21 1 0 32 0.0s 1 0 1 100.00% 8.2 8.2 0.00% 16 1 0 42 0.0s Solving report Status Optimal Primal bound 8.2 Dual bound 8.2 Gap 0% (tolerance: 0.01%) P-D integral 2.68565800593e-05 Solution status feasible 8.2 (objective) 0 (bound viol.) 5.01820807131e-14 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 42 (total) 0 (strong br.) 10 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 466 rows; 258 cols; 1120 nonzeros; 34 integer variables (34 binary) Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 18 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 3.2 from [lower, value, upper] = [ 0; -3.2; 0] Solution has num max sum Col infeasibilities 2 0.5 1 Integer infeasibilities 0 0 0 Row infeasibilities 165 7.473 466.6 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 466 rows; 258 cols; 1120 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [4e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 250 rows, 155 cols, 518 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 362 rows, 172 cols, 914 nonzeros 0s 317 rows, 127 cols, 955 nonzeros 0s 184 rows, 111 cols, 608 nonzeros 0s 179 rows, 106 cols, 611 nonzeros 0s Solving MIP model with: 179 rows 106 cols (16 binary, 0 integer, 0 implied int., 90 continuous) 611 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 9 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 39.77544606 inf inf 0 0 0 91 0.0s R 0 0 0 0.00% 39.77544606 55.86629641 28.80% 102 1 0 92 0.0s L 0 0 0 0.00% 46.75906763 52.66629641 11.22% 646 29 0 153 0.1s L 0 0 0 0.00% 47.35265161 52.66629641 10.09% 723 33 0 378 0.3s 6.2% inactive integer columns, restarting Model after restart has 165 rows, 99 cols (15 bin., 0 int., 0 impl., 84 cont.), and 583 nonzeros 0 0 0 0.00% 47.35265161 52.66629641 10.09% 17 0 0 531 0.3s 0 0 0 0.00% 47.35265161 52.66629641 10.09% 18 14 0 581 0.3s 6.7% inactive integer columns, restarting Model after restart has 163 rows, 98 cols (14 bin., 0 int., 0 impl., 84 cont.), and 571 nonzeros 0 0 0 0.00% 50.71605754 52.66629641 3.70% 14 0 0 815 0.4s 0 0 0 0.00% 50.71605754 52.66629641 3.70% 14 8 0 890 0.4s Symmetry detection completed in 0.0s No symmetry present 3 0 2 100.00% 52.66629641 52.66629641 0.00% 360 20 7 1539 0.7s Solving report Status Optimal Primal bound 52.6662964088 Dual bound 52.6662964088 Gap 0% (tolerance: 0.01%) P-D integral 0.049187901772 Solution status feasible 52.6662964088 (objective) 0 (bound viol.) 6.42820991282e-13 (int. viol.) 0 (row viol.) Timing 0.70 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 2 Nodes 3 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1539 (total) 192 (strong br.) 193 (separation) 847 (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: 306 #IntBinVar: 14 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.4843440055847168 Relaxation Obj: 5.6560522821656 MIPobj NLPobj Time ============================================= Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 1331 rows; 334 cols; 3660 nonzeros; 14 integer variables (14 binary) 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] = [ 0; 1; 0] WARNING: Row 36 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 by solving LP for user-supplied values of discrete variables LP has 1331 rows; 334 cols; 3660 nonzeros Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [2e-06, 5e+01] Presolving model 846 rows, 268 cols, 2392 nonzeros 0s 620 rows, 180 cols, 2028 nonzeros 0s Dependent equations search running on 104 equations with time limit of 1.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1.00s) 562 rows, 168 cols, 1874 nonzeros 0s Presolve : Reductions: rows 562(-769); columns 168(-166); elements 1874(-1786) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 7.9973483477e+00 Pr: 182(2058.06); Du: 0(1.99661e-12) 0s 132 7.9975868955e+00 0s Model status : Infeasible Simplex iterations: 132 Objective value : 7.9974097857e+00 HiGHS run time : 0.01 Presolving model 1010 rows, 275 cols, 3000 nonzeros 0s 862 rows, 195 cols, 2603 nonzeros 0s 742 rows, 152 cols, 2409 nonzeros 0s 724 rows, 148 cols, 2331 nonzeros 0s Solving MIP model with: 724 rows 148 cols (6 binary, 0 integer, 0 implied int., 142 continuous) 2331 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.815151259 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.407598659 6.802591963 64.61% 0 0 0 172 0.0s C 0 0 0 0.00% 3.984894684 5.81516365 31.47% 55 7 0 235 0.1s L 0 0 0 0.00% 3.984894684 3.984901819 0.00% 55 7 0 235 0.1s 1 0 1 100.00% 3.984894684 3.984901819 0.00% 55 7 0 244 0.1s Solving report Status Optimal Primal bound 3.98490181926 Dual bound 3.98489468411 Gap 0.000179% (tolerance: 0.01%) P-D integral 0.0308199656936 Solution status feasible 3.98490181926 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.11 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 244 (total) 0 (strong br.) 63 (separation) 9 (heuristics) 3.9849 1.9e-5 0.3 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 1374 rows; 362 cols; 3786 nonzeros; 42 integer variables (42 binary) 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] = [ 0; 1; 0] WARNING: Row 36 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 by solving LP for user-supplied values of discrete variables LP has 1374 rows; 362 cols; 3786 nonzeros 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.02 Presolving model 1053 rows, 303 cols, 3126 nonzeros 0s 905 rows, 223 cols, 2729 nonzeros 0s 747 rows, 154 cols, 2423 nonzeros 0s 729 rows, 150 cols, 2345 nonzeros 0s Solving MIP model with: 729 rows 150 cols (6 binary, 0 integer, 0 implied int., 144 continuous) 2345 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00907880828 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.001858054 2.007615521 0.29% 0 0 0 162 0.0s 1 0 1 100.00% 2.007615521 2.007615521 0.00% 0 0 0 188 0.1s Solving report Status Optimal Primal bound 2.00761552083 Dual bound 2.00761552083 Gap 0% (tolerance: 0.01%) P-D integral 2.2468381294e-05 Solution status feasible 2.00761552083 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 188 (total) 0 (strong br.) 26 (separation) 0 (heuristics) 2.0076 1.4e-5 0.5 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 1417 rows; 390 cols; 3968 nonzeros; 70 integer variables (70 binary) 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] = [ 0; 1; 0] WARNING: Row 36 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 by solving LP for user-supplied values of discrete variables LP has 1417 rows; 390 cols; 3968 nonzeros 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 1096 rows, 331 cols, 3308 nonzeros 0s 947 rows, 251 cols, 2855 nonzeros 0s 750 rows, 156 cols, 2425 nonzeros 0s 732 rows, 152 cols, 2347 nonzeros 0s Solving MIP model with: 732 rows 152 cols (6 binary, 0 integer, 0 implied int., 146 continuous) 2347 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540643997 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129948194 0.0130007341 0.05% 0 0 0 150 0.0s 16.7% inactive integer columns, restarting Model after restart has 419 rows, 102 cols (0 bin., 0 int., 0 impl., 102 cont.), and 1294 nonzeros 0 0 0 0.00% 0.0130007341 0.0130007341 0.00% 0 0 0 150 0.1s 1 0 1 100.00% 0.0130007341 0.0130007341 0.00% 0 0 0 206 0.1s Solving report Status Optimal Primal bound 0.0130007341293 Dual bound 0.0130007341293 Gap 0% (tolerance: 0.01%) P-D integral 3.74174767372e-06 Solution status feasible 0.0130007341293 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.07 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 206 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.013 1.4e-5 0.7 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 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 MIP has 1460 rows; 418 cols; 4206 nonzeros; 98 integer variables (98 binary) 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] = [ 0; 1; 0] WARNING: Row 36 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 by solving LP for user-supplied values of discrete variables LP has 1460 rows; 418 cols; 4206 nonzeros 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 1139 rows, 359 cols, 3546 nonzeros 0s 989 rows, 279 cols, 2981 nonzeros 0s 750 rows, 156 cols, 2425 nonzeros 0s 732 rows, 152 cols, 2347 nonzeros 0s Solving MIP model with: 732 rows 152 cols (6 binary, 0 integer, 0 implied int., 146 continuous) 2347 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540641046 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129946795 0.0130005941 0.05% 0 0 0 152 0.0s 16.7% inactive integer columns, restarting Model after restart has 419 rows, 102 cols (0 bin., 0 int., 0 impl., 102 cont.), and 1294 nonzeros 0 0 0 0.00% 0.0130005941 0.0130005941 0.00% 0 0 0 152 0.1s 1 0 1 100.00% 0.0130005941 0.0130005941 0.00% 0 0 0 208 0.1s Solving report Status Optimal Primal bound 0.0130005940961 Dual bound 0.0130005940961 Gap 0% (tolerance: 0.01%) P-D integral 6.95340051957e-06 Solution status feasible 0.0130005940961 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.06 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 208 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.7917749881744385 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 5.66 - 5.8 1 - 2 3 - 7.38 - 6.6 - 70.3% 3 3 - 8.24 - 6.9 - 91.1% 3 4 - 8.24 - 7.6 - 7903.4% 3 5 - 8.24 - 8.3 - 82.1% 3 4 - 8.45 - 9.1 - 68.7% 3 5 - 8.95 - 9.8 - 83.6% 0 6 10.2 10.20001 0.0% 10.0 - 83.7% #branches: 8 Obj: 10.200001576561705 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 284 rows; 162 cols; 690 nonzeros; 16 integer variables (16 binary) 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] = [ 0; 1; 0] 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 by solving LP for user-supplied values of discrete variables LP has 284 rows; 162 cols; 690 nonzeros Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 144 rows, 84 cols, 292 nonzeros 0s 48 rows, 30 cols, 114 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 182 rows, 60 cols, 539 nonzeros 0s 115 rows, 54 cols, 400 nonzeros 0s 113 rows, 52 cols, 417 nonzeros 0s Solving MIP model with: 113 rows 52 cols (8 binary, 0 integer, 0 implied int., 44 continuous) 417 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 71 0.0s R 0 0 0 0.00% 622.3278939 659.9091248 5.69% 81 3 0 72 0.0s 25.0% inactive integer columns, restarting Model after restart has 76 rows, 42 cols (4 bin., 0 int., 0 impl., 38 cont.), and 249 nonzeros 0 0 0 0.00% 622.3278939 659.9091248 5.69% 1 0 0 97 0.0s 0 0 0 0.00% 622.3278939 659.9091248 5.69% 1 1 0 98 0.0s H 0 0 0 0.00% 646.2927624 659.9091248 2.06% 59 3 1 102 0.0s T 0 0 0 0.00% 646.2927624 659.9091248 2.06% 59 3 1 130 0.0s 1 0 1 100.00% 659.9091248 659.9091248 0.00% 56 3 1 130 0.0s Solving report Status Optimal Primal bound 659.909124818 Dual bound 659.909124818 Gap 0% (tolerance: 0.01%) P-D integral 0.000658641099791 Solution status feasible 659.909124818 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 130 (total) 0 (strong br.) 5 (separation) 42 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 2884 rows; 1920 cols; 7669 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 144 5 441.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 2884 rows; 1920 cols; 7669 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Presolving model 744 rows, 864 cols, 2088 nonzeros 0s 384 rows, 600 cols, 1201 nonzeros 0s 240 rows, 480 cols, 720 nonzeros 0s 120 rows, 270 cols, 360 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-2884); columns 0(-1920); elements 0(-7669) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.1030420000e+08 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2164 rows, 1824 cols, 6661 nonzeros 0s 1756 rows, 1546 cols, 6200 nonzeros 0s 1682 rows, 1474 cols, 6436 nonzeros 0s MIP start solution is feasible, objective value is 310304200 Solving MIP model with: 1682 rows 1474 cols (562 binary, 0 integer, 0 implied int., 912 continuous) 6436 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -2000 310304200 100.00% 0 0 0 0 0.1s R 0 0 0 0.00% 844938.897072 17804230.53629 95.25% 0 0 0 847 0.1s C 0 0 0 0.00% 891194.698317 1101584.606252 19.10% 1524 91 0 1008 0.4s L 0 0 0 0.00% 893123.259247 893123.513229 0.00% 3188 91 0 1070 1.4s 1 0 1 100.00% 893123.267916 893123.513229 0.00% 3188 91 0 1503 1.4s Solving report Status Optimal Primal bound 893123.513229 Dual bound 893123.267916 Gap 2.7e-05% (tolerance: 0.01%) P-D integral 0.512058617737 Solution status feasible 893123.513229 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 1.42 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 4 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1503 (total) 0 (strong br.) 223 (separation) 431 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 2884 rows; 1920 cols; 7669 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 144 5 441.4 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 2884 rows; 1920 cols; 7669 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 8e+00] RHS [5e-01, 5e+00] Presolving model 867 rows, 918 cols, 2337 nonzeros 0s 384 rows, 600 cols, 1201 nonzeros 0s 240 rows, 480 cols, 720 nonzeros 0s 120 rows, 270 cols, 360 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-2884); columns 0(-1920); elements 0(-7669) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.1030420000e+08 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.01 Presolving model 2164 rows, 1824 cols, 6661 nonzeros 0s 1810 rows, 1606 cols, 5844 nonzeros 0s MIP start solution is feasible, objective value is 310304200 Solving MIP model with: 1810 rows 1606 cols (240 binary, 0 integer, 6 implied int., 1360 continuous) 5844 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 310304200 100.00% 0 0 0 0 0.0s R 0 0 0 0.00% 844938.897072 26115250.72428 96.76% 0 0 0 825 0.1s C 0 0 0 0.00% 891808.024045 1106300.351765 19.39% 1271 103 0 1018 0.3s L 0 0 0 0.00% 893123.513229 893123.513229 0.00% 1820 122 0 1056 0.6s 1 0 1 100.00% 893123.513229 893123.513229 0.00% 1820 122 0 1134 0.6s Solving report Status Optimal Primal bound 893123.513229 Dual bound 893123.513229 Gap 0% (tolerance: 0.01%) P-D integral 0.315824338526 Solution status feasible 893123.513229 (objective) 0 (bound viol.) 6.66133814775e-16 (int. viol.) 0 (row viol.) Timing 0.60 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1134 (total) 0 (strong br.) 231 (separation) 78 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3244 rows; 2304 cols; 8629 nonzeros; 720 integer variables (720 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.7 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3244 rows; 2304 cols; 8629 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 936 rows, 1080 cols, 2712 nonzeros 0s 586 rows, 819 cols, 1923 nonzeros 0s 414 rows, 702 cols, 1475 nonzeros 0s Dependent equations search running on 393 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 393 rows, 660 cols, 1391 nonzeros 0s Presolve : Reductions: rows 393(-2851); columns 660(-1644); elements 1391(-7238) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -5.9615389266e-03 Pr: 393(4734.87); Du: 0(1.62801e-12) 0s 474 3.1063105523e+08 0s Model status : Infeasible Simplex iterations: 474 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2356 rows, 2040 cols, 7285 nonzeros 0s 1968 rows, 1758 cols, 6725 nonzeros 0s 1682 rows, 1499 cols, 6446 nonzeros 0s Solving MIP model with: 1682 rows 1499 cols (562 binary, 0 integer, 0 implied int., 937 continuous) 6446 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -3600 inf inf 0 0 0 0 0.1s 0 0 0 0.00% 829745.562234 inf inf 0 0 3 872 0.1s R 0 0 0 0.00% 841699.419293 930888.434656 9.58% 297 25 3 928 0.2s C 0 0 0 0.00% 854628.222077 893963.615673 4.40% 1437 69 3 1042 0.4s L 0 0 0 0.00% 863744.863332 869583.36262 0.67% 4740 119 3 1361 3.0s 19.4% inactive integer columns, restarting Model after restart has 1356 rows, 1204 cols (411 bin., 0 int., 0 impl., 793 cont.), and 5103 nonzeros 0 0 0 0.00% 863781.128607 869583.36262 0.67% 58 0 0 4006 6.3s 0 0 0 0.00% 863781.128607 869583.36262 0.67% 58 55 0 4191 6.3s 2 0 1 50.00% 864296.633015 869583.36262 0.61% 319 56 12 8736 13.1s T 2 0 1 50.00% 864296.633015 869583.36262 0.61% 326 56 213 8736 13.2s 5 0 3 100.00% 869583.36262 869583.36262 0.00% 328 56 214 8992 13.2s Solving report Status Optimal Primal bound 869583.36262 Dual bound 869583.36262 Gap 0% (tolerance: 0.01%) P-D integral 0.16987175386 Solution status feasible 869583.36262 (objective) 0 (bound viol.) 8.35376212649e-12 (int. viol.) 0 (row viol.) Timing 13.17 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 6 Nodes 5 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 8992 (total) 973 (strong br.) 620 (separation) 6201 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3244 rows; 2304 cols; 8629 nonzeros; 240 integer variables (240 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 264 5 537.7 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3244 rows; 2304 cols; 8629 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 1059 rows, 1134 cols, 2961 nonzeros 0s 586 rows, 819 cols, 1923 nonzeros 0s 414 rows, 702 cols, 1475 nonzeros 0s Dependent equations search running on 393 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 393 rows, 660 cols, 1391 nonzeros 0s Presolve : Reductions: rows 393(-2851); columns 660(-1644); elements 1391(-7238) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -5.9615389266e-03 Pr: 393(4734.87); Du: 0(1.62801e-12) 0s 474 3.1063105523e+08 0s Model status : Infeasible Simplex iterations: 474 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2356 rows, 2040 cols, 7285 nonzeros 0s 1883 rows, 1721 cols, 6157 nonzeros 0s 1811 rows, 1631 cols, 5892 nonzeros 0s Solving MIP model with: 1811 rows 1631 cols (240 binary, 0 integer, 6 implied int., 1385 continuous) 5892 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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% 829745.562234 inf inf 0 0 2 869 0.1s R 0 0 0 0.00% 841844.808088 1742603.498205 51.69% 214 29 2 929 0.2s C 0 0 0 0.00% 854576.252273 905096.214992 5.58% 1149 81 2 1058 0.3s L 0 0 0 0.00% 860942.340809 869583.36262 0.99% 2751 87 2 1345 1.7s L 0 0 0 0.00% 860953.267906 869583.36262 0.99% 2751 91 2 2135 2.6s 2.9% inactive integer columns, restarting Model after restart has 1614 rows, 1451 cols (229 bin., 0 int., 3 impl., 1219 cont.), and 5442 nonzeros 0 0 0 0.00% 860953.267906 869583.36262 0.99% 57 0 0 2863 2.6s 0 0 0 0.00% 860953.267906 869583.36262 0.99% 57 53 0 3027 2.7s L 0 0 0 0.00% 860957.388498 869583.36262 0.99% 73 58 0 4332 5.1s 5 0 3 100.00% 869526.987182 869583.36262 0.01% 83 54 38 7211 6.8s Solving report Status Optimal Primal bound 869583.36262 Dual bound 869526.987182 Gap 0.00648% (tolerance: 0.01%) P-D integral 0.19052566554 Solution status feasible 869583.36262 (objective) 0 (bound viol.) 3.09419156963e-13 (int. viol.) 0 (row viol.) Timing 6.81 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 4 Nodes 5 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 7211 (total) 1119 (strong br.) 485 (separation) 4425 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3630 rows; 2592 cols; 9493 nonzeros; 768 integer variables (768 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 38 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 408 5 650.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3630 rows; 2592 cols; 9493 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 936 rows, 1080 cols, 2712 nonzeros 0s 585 rows, 818 cols, 1916 nonzeros 0s 413 rows, 701 cols, 1469 nonzeros 0s Dependent equations search running on 391 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 391 rows, 657 cols, 1381 nonzeros 0s Presolve : Reductions: rows 391(-3239); columns 657(-1935); elements 1381(-8112) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.0689033078e-03 Pr: 391(4223.97); Du: 0(6.34572e-13) 0s 465 3.1063118197e+08 0s Model status : Infeasible Simplex iterations: 465 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2452 rows, 2232 cols, 7667 nonzeros 0s 2026 rows, 1912 cols, 6993 nonzeros 0s 1735 rows, 1650 cols, 6781 nonzeros 0s Solving MIP model with: 1735 rows 1650 cols (569 binary, 0 integer, 0 implied int., 1081 continuous) 6781 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -1000 inf inf 0 0 0 0 0.1s R 0 0 0 0.00% 822387.098796 951480.526324 13.57% 0 0 0 978 0.2s C 0 0 0 0.00% 844004.537066 875480.526324 3.60% 1679 77 0 1179 0.4s L 0 0 0 0.00% 848743.825523 857044.684693 0.97% 6543 108 0 1841 5.3s L 0 0 0 0.00% 848771.556636 857044.684693 0.97% 6319 110 0 3475 9.2s 16.7% inactive integer columns, restarting Model after restart has 1475 rows, 1406 cols (446 bin., 0 int., 0 impl., 960 cont.), and 5604 nonzeros 0 0 0 0.00% 848771.556636 857044.684693 0.97% 58 0 0 6681 9.3s 0 0 0 0.00% 848771.556636 857044.684693 0.97% 58 56 0 6978 9.3s 0 0 0 0.00% 849522.951054 857044.684693 0.88% 835 67 0 11671 15.1s 1 0 0 100.00% 857008.065481 857044.684693 0.00% 846 67 35 15248 17.5s Solving report Status Optimal Primal bound 857044.684693 Dual bound 857008.065481 Gap 0.00427% (tolerance: 0.01%) P-D integral 0.293275359363 Solution status feasible 857044.684693 (objective) 0 (bound viol.) 4.35866625796e-14 (int. viol.) 0 (row viol.) Timing 17.49 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 7 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 15248 (total) 1534 (strong br.) 1165 (separation) 11035 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 3630 rows; 2592 cols; 9493 nonzeros; 288 integer variables (288 binary) Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 38 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 2.25 from [lower, value, upper] = [ 0; 2.25; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 408 5 650.3 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 3630 rows; 2592 cols; 9493 nonzeros Coefficient ranges: Matrix [4e-01, 2e+02] Cost [1e+02, 1e+06] Bound [4e-01, 1e+01] RHS [7e-03, 5e+00] Presolving model 1059 rows, 1134 cols, 2961 nonzeros 0s 585 rows, 818 cols, 1916 nonzeros 0s 413 rows, 701 cols, 1469 nonzeros 0s Dependent equations search running on 391 equations with time limit of 1000.00s Dependent equations search removed 0 rows and 0 nonzeros in 0.00s (limit = 1000.00s) 391 rows, 657 cols, 1381 nonzeros 0s Presolve : Reductions: rows 391(-3239); columns 657(-1935); elements 1381(-8112) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 -6.0689033078e-03 Pr: 391(4223.97); Du: 0(6.34572e-13) 0s 465 3.1063118197e+08 0s Model status : Infeasible Simplex iterations: 465 Objective value : 3.1062243837e+08 HiGHS run time : 0.02 Presolving model 2452 rows, 2232 cols, 7667 nonzeros 0s 1929 rows, 1863 cols, 6438 nonzeros 0s 1859 rows, 1775 cols, 6178 nonzeros 0s Solving MIP model with: 1859 rows 1775 cols (240 binary, 0 integer, 6 implied int., 1529 continuous) 6178 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src 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 R 0 0 0 0.00% 822387.098796 1144845.504073 28.17% 0 0 0 946 0.1s C 0 0 0 0.00% 844738.582353 887063.125642 4.77% 1144 97 0 1223 0.4s L 0 0 0 0.00% 849704.386075 857044.684693 0.86% 4202 96 0 1723 2.2s L 0 0 0 0.00% 849800.290579 857044.684693 0.85% 4116 98 0 2637 3.0s 4.2% inactive integer columns, restarting Model after restart has 1650 rows, 1592 cols (226 bin., 0 int., 3 impl., 1363 cont.), and 5692 nonzeros 0 0 0 0.00% 849800.290579 857044.684693 0.85% 67 0 0 3581 3.0s 0 0 0 0.00% 849800.290579 857044.684693 0.85% 67 65 0 3796 3.1s L 0 0 0 0.00% 849950.558553 857044.684693 0.83% 208 95 0 3884 4.8s L 0 0 0 0.00% 849950.558553 857044.684693 0.83% 208 95 0 5271 5.6s 1 0 1 100.00% 856960.946811 857044.684693 0.01% 216 68 14 8128 7.0s Solving report Status Optimal Primal bound 857044.684693 Dual bound 856960.946811 Gap 0.00977% (tolerance: 0.01%) P-D integral 0.182536901827 Solution status feasible 857044.684693 (objective) 0 (bound viol.) 3.74020672314e-13 (int. viol.) 0 (row viol.) Timing 7.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 4 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 8128 (total) 400 (strong br.) 896 (separation) 5554 (heuristics) Any[1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 201, 211, 221, 231] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 31300 rows; 18624 cols; 78860 nonzeros; 1152 integer variables (1152 binary) Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 16338 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 1680 5 1709 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 31300 rows; 18624 cols; 78860 nonzeros Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.02 Presolving model 8318 rows, 6192 cols, 39270 nonzeros 0s 6864 rows, 4806 cols, 35420 nonzeros 0s 4542 rows, 2758 cols, 17818 nonzeros 0s 4315 rows, 2514 cols, 17851 nonzeros 0s Solving MIP model with: 4315 rows 2514 cols (905 binary, 0 integer, 96 implied int., 1513 continuous) 17851 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 88800 inf inf 0 0 0 0 0.3s R 0 0 0 0.00% 1219855.63119 22272563.42758 94.52% 0 0 0 1351 0.6s C 0 0 0 0.00% 1244722.915011 1252209.228759 0.60% 1260 211 0 1594 1.0s L 0 0 0 0.00% 1244722.915011 1251663.01406 0.55% 1260 211 0 1594 4.0s L 0 0 0 0.00% 1245235.930525 1251663.01406 0.51% 1362 219 0 2650 6.2s 13.8% inactive integer columns, restarting Model after restart has 3552 rows, 2131 cols (696 bin., 0 int., 86 impl., 1349 cont.), and 14832 nonzeros 0 0 0 0.00% 1245235.930525 1251663.01406 0.51% 90 0 0 3357 6.3s 0 0 0 0.00% 1245235.930525 1251663.01406 0.51% 90 80 0 3654 6.4s L 0 0 0 0.00% 1248476.615832 1251663.01406 0.25% 520 143 0 3750 11.7s 12.1% inactive integer columns, restarting Model after restart has 3124 rows, 1904 cols (545 bin., 0 int., 77 impl., 1282 cont.), and 12749 nonzeros 0 0 0 0.00% 1248476.615832 1251663.01406 0.25% 85 0 0 6401 15.1s 0 0 0 0.00% 1248476.615832 1251663.01406 0.25% 85 78 0 6726 15.1s 0 0 0 0.00% 1249244.782035 1251663.01406 0.19% 204 82 0 9828 26.4s 10.8% inactive integer columns, restarting Model after restart has 2868 rows, 1783 cols (460 bin., 0 int., 71 impl., 1252 cont.), and 11411 nonzeros 0 0 0 0.00% 1249244.782035 1251663.01406 0.19% 79 0 0 9828 26.5s 0 0 0 0.00% 1249244.970308 1251663.01406 0.19% 79 76 0 10057 26.5s 0 0 0 0.00% 1250622.491778 1251663.01406 0.08% 613 86 0 13066 36.5s 10.9% inactive integer columns, restarting Model after restart has 2376 rows, 1579 cols (343 bin., 0 int., 54 impl., 1182 cont.), and 9209 nonzeros 0 0 0 0.00% 1250622.491778 1251663.01406 0.08% 83 0 0 13066 36.6s 0 0 0 0.00% 1250630.02274 1251663.01406 0.08% 83 75 0 13323 36.7s 14.3% inactive integer columns, restarting Model after restart has 2106 rows, 1468 cols (266 bin., 0 int., 44 impl., 1158 cont.), and 8032 nonzeros 0 0 0 0.00% 1250774.872873 1251663.01406 0.07% 77 0 0 15140 41.7s 0 0 0 0.00% 1250774.902049 1251663.01406 0.07% 77 73 0 15402 41.7s 12.8% inactive integer columns, restarting Model after restart has 1898 rows, 1373 cols (221 bin., 0 int., 31 impl., 1121 cont.), and 7216 nonzeros 0 0 0 0.00% 1251146.8592 1251663.01406 0.04% 74 0 0 15467 41.9s 0 0 0 0.00% 1251151.108878 1251663.01406 0.04% 74 72 0 15692 41.9s 10.4% inactive integer columns, restarting Model after restart has 1751 rows, 1315 cols (181 bin., 0 int., 26 impl., 1108 cont.), and 6598 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1251346.879878 1251663.01406 0.03% 70 0 0 15768 42.1s 0 0 0 0.00% 1251351.044563 1251663.01406 0.02% 70 70 0 15956 42.1s 11.6% inactive integer columns, restarting Model after restart has 1601 rows, 1270 cols (159 bin., 0 int., 21 impl., 1090 cont.), and 5940 nonzeros 0 0 0 0.00% 1251506.769295 1251663.01406 0.01% 68 0 0 16039 42.3s 0 0 0 0.00% 1251506.770413 1251663.01406 0.01% 68 66 0 16234 42.3s 1 0 1 100.00% 1251538.147611 1251663.01406 0.01% 231 92 0 16270 42.4s Solving report Status Optimal Primal bound 1251663.01406 Dual bound 1251538.14761 Gap 0.00998% (tolerance: 0.01%) P-D integral 0.509605028081 Solution status feasible 1251663.01406 (objective) 0 (bound viol.) 1.50768286744e-13 (int. viol.) 0 (row viol.) Timing 42.43 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 7 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 16270 (total) 0 (strong br.) 760 (separation) 12181 (heuristics) Any[1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 201, 211, 221, 231] Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 31780 rows; 18624 cols; 79340 nonzeros; 1152 integer variables (1152 binary) Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 16338 has infeasibility of 0.5 from [lower, value, upper] = [ 0; 1; 0.5] WARNING: Row 1 has infeasibility of 1.8 from [lower, value, upper] = [ 0; 1.8; 0] Solution has num max sum Col infeasibilities 96 0.5 38.4 Integer infeasibilities 0 0 0 Row infeasibilities 1680 5 1709 Row residuals 0 0 0 Attempting to find feasible solution by solving LP for user-supplied values of discrete variables LP has 31780 rows; 18624 cols; 79340 nonzeros Coefficient ranges: Matrix [5e-01, 3e+02] Cost [2e+01, 1e+06] Bound [5e-01, 1e+06] RHS [1e-03, 1e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.02 Presolving model 8126 rows, 5952 cols, 35958 nonzeros 0s 6624 rows, 4614 cols, 31052 nonzeros 0s 4072 rows, 2566 cols, 15565 nonzeros 0s 3658 rows, 2366 cols, 14843 nonzeros 0s Solving MIP model with: 3658 rows 2366 cols (939 binary, 0 integer, 79 implied int., 1348 continuous) 14843 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 88800 inf inf 0 0 0 0 0.3s R 0 0 0 0.00% 65118373.49489 78823531.45371 17.39% 0 0 0 931 0.5s L 0 0 0 0.00% 69829723.85337 69829723.85337 0.00% 237 113 0 960 0.8s T 0 0 0 0.00% 69829723.85337 69829723.85337 0.00% 237 113 0 1047 0.8s 1 0 1 100.00% 69829723.85337 69829723.85337 0.00% 237 113 0 1047 0.8s Solving report Status Optimal Primal bound 69829723.8534 Dual bound 69829723.8534 Gap 0% (tolerance: 0.01%) P-D integral 0.0430088746728 Solution status feasible 69829723.8534 (objective) 0 (bound viol.) 2.6645352591e-15 (int. viol.) 0 (row viol.) Timing 0.80 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 1 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1047 (total) 0 (strong br.) 29 (separation) 87 (heuristics) Test Summary: | Pass Total Time PowerModelsACDC | 348 348 15m00.1s Testing PowerModelsACDC tests passed Testing completed after 1245.43s PkgEval succeeded after 1375.05s