Package evaluation of PowerModelsACDC on Julia 1.13.0-DEV.449 (8d6b63c3a6*) started at 2025-04-29T03:45:07.643 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.17s ################################################################################ # Installation # Installing PowerModelsACDC... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [ff45984e] + PowerModelsACDC v0.8.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.14.0 [79e6a3ab] + Adapt v4.3.0 [4fba245c] + ArrayInterface v7.18.0 [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [187b0558] + ConstructionBase v1.5.8 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [a0c0ee7d] + DifferentiationInterface v0.6.52 [b4f34e82] + Distances v0.10.12 [ffbed154] + DocStringExtensions v0.9.4 [6a86dc24] + FiniteDiff v2.27.0 [f6369f11] + ForwardDiff v1.0.1 [2030c09a] + InfrastructureModels v0.7.8 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.2 [4076af6c] + JuMP v1.25.0 [d3d80556] + LineSearches v7.3.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.39.0 [f28f55f0] + Memento v1.4.1 [d8a4904e] + MutableArithmetics v1.6.4 [d41bc354] + NLSolversBase v7.9.1 [2774e3e8] + NLsolve v4.5.1 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.0 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [c36e90e8] + PowerModels v0.21.3 [ff45984e] + PowerModelsACDC v0.8.0 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.12.0+0 Installation completed after 4.08s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 173.58s ################################################################################ # Testing # Testing PowerModelsACDC Status `/tmp/jl_vsTeht/Project.toml` ⌅ [87dc4568] HiGHS v1.9.3 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.2 [4076af6c] JuMP v1.25.0 [2ddba703] Juniper v0.9.3 [f28f55f0] Memento v1.4.1 [2774e3e8] NLsolve v4.5.1 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_vsTeht/Manifest.toml` [47edcb42] ADTypes v1.14.0 [79e6a3ab] Adapt v4.3.0 [4fba245c] ArrayInterface v7.18.0 [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.5.8 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.6.52 [b4f34e82] Distances v0.10.12 [ffbed154] DocStringExtensions v0.9.4 [6a86dc24] FiniteDiff v2.27.0 [f6369f11] ForwardDiff v1.0.1 ⌅ [87dc4568] HiGHS v1.9.3 [2030c09a] InfrastructureModels v0.7.8 [b6b21f68] Ipopt v1.10.2 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.2 [4076af6c] JuMP v1.25.0 [2ddba703] Juniper v0.9.3 [d3d80556] LineSearches v7.3.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.39.0 [f28f55f0] Memento v1.4.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.9.1 [2774e3e8] NLsolve v4.5.1 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.0 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [c36e90e8] PowerModels v0.21.3 [ff45984e] PowerModelsACDC v0.8.0 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [efcf1570] Setfield v1.1.2 [276daf66] SpecialFunctions v2.5.1 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 ⌅ [8fd58aa0] HiGHS_jll v1.7.2+0 [e33a78d0] Hwloc_jll v2.12.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.12.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2024.12.31 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.0.16+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.12.0+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 13018.0 ms ✓ Juniper 1 dependency successfully precompiled in 14 seconds. 52 already precompiled. ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 114 rows, 73 cols, 244 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 178 rows, 90 cols, 448 nonzeros 0s 156 rows, 69 cols, 460 nonzeros 0s 90 rows, 62 cols, 298 nonzeros 0s 87 rows, 59 cols, 289 nonzeros 0s Solving MIP model with: 87 rows 59 cols (16 binary, 0 integer, 0 implied int., 43 continuous) 289 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.2s 0 0 0 0.00% 20.06401564 inf inf 0 0 0 45 0.2s R 0 0 0 0.00% 20.06401564 27.9331482 28.17% 72 2 0 47 0.4s L 0 0 0 0.00% 23.42573978 26.9331482 13.02% 289 30 0 102 0.4s L 0 0 0 0.00% 23.42573978 26.9331482 13.02% 289 11 0 181 0.5s B 7 0 3 25.00% 23.42573978 26.3331482 11.04% 296 11 10 553 0.5s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.52 (total) 0.24 (presolve) 0.00 (postsolve) Nodes 9 LP iterations 604 (total) 166 (strong br.) 57 (separation) 269 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 2e+01] Cost [1e+00, 5e+00] Bound [1e-01, 2e+01] RHS [9e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 9 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 3] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ -0.9; -3.6; -0.9] Solution has num max sum Col infeasibilities 3 0.1 0.3 Integer infeasibilities 0 0 0 Row infeasibilities 24 7.2 70.96 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 2e+01] Cost [1e+00, 5e+00] Bound [1e-01, 2e+01] RHS [9e-01, 6e+00] Presolving model 49 rows, 32 cols, 110 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 64 rows, 35 cols, 150 nonzeros 0s 36 rows, 20 cols, 106 nonzeros 0s 25 rows, 19 cols, 76 nonzeros 0s 22 rows, 16 cols, 66 nonzeros 0s Objective function is integral with scale 10 Solving MIP model with: 22 rows 16 cols (3 binary, 0 integer, 0 implied int., 13 continuous) 66 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 7.5 inf inf 0 0 0 0 0.0s 33.3% inactive integer columns, restarting Solving report Status Optimal Primal bound 10.7 Dual bound 10.7 Gap 0% (tolerance: 0.01%) Solution status feasible 10.7 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 13 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [5e-01, 1e+01] RHS [1e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 3.372 from [lower, value, upper] = [ -0.228; -3.6; -0.228] WARNING: Row 35 has infeasibility of 26.47 from [lower, value, upper] = [ 0; 26.473; 0] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 751 35.47 1674 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+01] Bound [5e-01, 1e+01] RHS [1e-01, 6e+00] Presolving model 682 rows, 372 cols, 1412 nonzeros 0s 73 rows, 41 cols, 202 nonzeros 0s 60 rows, 33 cols, 174 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1210 rows, 599 cols, 3030 nonzeros 0s 643 rows, 535 cols, 2014 nonzeros 0s 643 rows, 535 cols, 2014 nonzeros 0s Solving MIP model with: 643 rows 535 cols (227 binary, 0 integer, 0 implied int., 308 continuous) 2014 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 8.06450689 inf inf 0 0 0 476 0.0s C 0 0 0 0.00% 8.304680746 2502.236296 99.67% 17 6 0 540 0.1s L 0 0 0 0.00% 8.394986897 15.6920988 46.50% 94 40 0 635 0.7s 59.9% inactive integer columns, restarting Model after restart has 366 rows, 260 cols (91 bin., 0 int., 0 impl., 169 cont.), and 1194 nonzeros 0 0 0 0.00% 8.397034794 15.6920988 46.49% 28 0 0 2019 1.0s 0 0 0 0.00% 8.397034794 15.6920988 46.49% 28 26 0 2073 1.0s L 0 0 0 0.00% 8.453705296 15.6920988 46.13% 241 81 0 2381 1.5s Restarting search from the root node Model after restart has 137 rows, 90 cols (18 bin., 0 int., 0 impl., 72 cont.), and 470 nonzeros 62 0 0 0.00% 15.10807433 15.6920988 3.72% 22 0 0 14152 3.2s 72.2% inactive integer columns, restarting Model after restart has 72 rows, 54 cols (3 bin., 0 int., 0 impl., 51 cont.), and 241 nonzeros 62 0 0 0.00% 15.32144241 15.6920988 2.36% 1 0 0 14205 3.2s Solving report Status Optimal Primal bound 15.6920988029 Dual bound 15.6920988029 Gap 0% (tolerance: 0.01%) Solution status feasible 15.6920988029 (objective) 0 (bound viol.) 4.29277044577e-13 (int. viol.) 0 (row viol.) Timing 3.21 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 63 LP iterations 14209 (total) 5424 (strong br.) 525 (separation) 5781 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [1e+00, 5e+01] RHS [7e-02, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 2 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 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 for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 4e+02] Cost [1e-01, 7e+00] Bound [1e+00, 5e+01] RHS [7e-02, 1e+01] Presolving model 328 rows, 198 cols, 735 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 481 rows, 254 cols, 1215 nonzeros 0s 397 rows, 199 cols, 1142 nonzeros 0s 228 rows, 185 cols, 745 nonzeros 0s 224 rows, 181 cols, 756 nonzeros 0s Solving MIP model with: 224 rows 181 cols (55 binary, 0 integer, 0 implied int., 126 continuous) 756 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.48 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 19.44392647 inf inf 0 0 0 187 0.0s C 0 0 0 0.00% 21.77371928 207.1616498 89.49% 158 24 0 224 0.1s L 0 0 0 0.00% 22.62998445 25.16054482 10.06% 430 63 0 328 0.2s L 0 0 0 0.00% 22.90095693 25.16054482 8.98% 463 60 0 701 0.5s 12.7% inactive integer columns, restarting Model after restart has 204 rows, 164 cols (48 bin., 0 int., 0 impl., 116 cont.), and 693 nonzeros 0 0 0 0.00% 22.90095693 25.16054482 8.98% 26 0 0 1118 0.5s 0 0 0 0.00% 22.90095693 25.16054482 8.98% 26 26 0 1172 0.5s Solving report Status Optimal Primal bound 25.1605448204 Dual bound 25.1605448204 Gap 0% (tolerance: 0.01%) Solution status feasible 25.1605448204 (objective) 0 (bound viol.) 5.26491109097e-11 (int. viol.) 0 (row viol.) Timing 1.45 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 9 LP iterations 3539 (total) 593 (strong br.) 286 (separation) 2239 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 171 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 19.08258318901062 Relaxation Obj: 20.98369833166603 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [1e-07, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 117 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 55 7.473 107.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [1e-07, 2e+00] Presolving model 131 rows, 109 cols, 168 nonzeros 0s 3 rows, 4 cols, 6 nonzeros 0s Presolve : Reductions: rows 3(-237); columns 4(-201); elements 6(-507) Solving the presolved LP Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 6.7368056333e+00 HiGHS run time : 0.00 Presolving model 215 rows, 151 cols, 458 nonzeros 0s 115 rows, 87 cols, 296 nonzeros 0s 98 rows, 66 cols, 230 nonzeros 0s 72 rows, 53 cols, 178 nonzeros 0s 46 rows, 42 cols, 126 nonzeros 0s MIP start solution is feasible, objective value is 6.73680563326 Solving MIP model with: 46 rows 42 cols (11 binary, 0 integer, 5 implied int., 26 continuous) 126 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 2.406351626 6.736805633 64.28% 0 0 0 0 0.0s T 0 0 0 0.00% 2.406351626 2.406353594 0.00% 0 0 0 23 0.0s Solving report Status Optimal Primal bound 2.40635359402 Dual bound 2.40635359402 Gap 0% (tolerance: 0.01%) Solution status feasible 2.40635359402 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 23 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 2.4064 0.087 28.5 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 117 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] Solution has num max sum Col infeasibilities 6 3.6 21.6 Integer infeasibilities 0 0 0 Row infeasibilities 71 7.473 115.1 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 2e+01] Cost [1e+00, 1e+00] Bound [1e-01, 2e+01] RHS [4e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 275 rows, 185 cols, 627 nonzeros 0s 164 rows, 117 cols, 438 nonzeros 0s 143 rows, 92 cols, 358 nonzeros 0s 117 rows, 79 cols, 306 nonzeros 0s 75 rows, 52 cols, 198 nonzeros 0s Solving MIP model with: 75 rows 52 cols (16 binary, 0 integer, 1 implied int., 35 continuous) 198 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4301982411 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.9963426431 0.9988795225 0.25% 0 0 0 36 0.0s 37.5% inactive integer columns, restarting Model after restart has 3 rows, 4 cols (0 bin., 0 int., 0 impl., 4 cont.), and 6 nonzeros 0 0 0 0.00% 0.9988795225 0.9988795225 0.00% 0 0 0 36 0.0s Solving report Status Optimal Primal bound 0.998879522545 Dual bound 0.998879522545 Gap 0% (tolerance: 0.01%) Solution status feasible 0.998879522545 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 36 (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 0.9989 - 32.5 FP: 32.510534048080444 s FP: 2 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 20.98 - 10.4 4 - 3 3 - 29.84 - 11.8 - 92.2% 4 3 - 31.27 - 11.9 - 77.4% 5 4 - 30.97 - 12.1 - 72.7% 6 5 - 31.14 - 12.2 - 84.0% 7 6 - 31.39 - 12.3 - 11.7% 8 7 - 31.4 - 12.6 - 94.8% 9 4 - 31.48 - 12.7 - 80.9% 10 5 - 31.62 - 12.8 - 84.3% 7 4 33.27 31.89 4.15% 13.0 - 92.5% 7 5 33.27 31.67 4.81% 13.1 - 97.1% 7 6 33.2 31.99 3.65% 13.2 - 92.8% 7 6 33.2 32.13 3.23% 13.4 - 64.0% 8 4 33.2 32.15 3.16% 13.5 - 97.1% 9 5 33.2 31.92 3.86% 13.6 - 65.0% 10 6 33.2 31.41 5.41% 13.8 - 80.2% 11 7 33.2 31.9 3.9% 14.0 - 18.6% 11 8 33.2 32.05 3.47% 14.2 - 94.6% 11 6 33.2 32.07 3.4% 31.2 - 86.5% 11 7 33.2 32.07 3.4% 31.3 - 89.9% 11 8 33.2 32.15 3.16% 31.3 - 80.8% 11 5 33.2 32.2 3.03% 31.4 - 93.7% 11 6 33.2 32.2 3.01% 31.6 - 98.7% 0 7 32.200611 32.200612 0.0% 31.6 - 98.5% #branches: 24 Obj: 32.20061146331135 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 94 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.1788330078125 Relaxation Obj: 1.4678142298092867 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [4e-06, 1e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 18 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 3] WARNING: Col 76 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ -0.9; -3.6; -0.9] Solution has num max sum Col infeasibilities 5 3.6 7.5 Integer infeasibilities 0 0 0 Row infeasibilities 20 7.2 33 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [4e-06, 1e+00] Presolving model 36 rows, 37 cols, 48 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-89); columns 0(-102); elements 0(-185) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 1.9552835781e+00 HiGHS run time : 0.00 Presolving model 55 rows, 46 cols, 107 nonzeros 0s 22 rows, 19 cols, 52 nonzeros 0s 18 rows, 11 cols, 38 nonzeros 0s 12 rows, 8 cols, 26 nonzeros 0s 8 rows, 6 cols, 18 nonzeros 0s MIP start solution is feasible, objective value is 1.95528357808 Solving MIP model with: 8 rows 6 cols (3 binary, 0 integer, 0 implied int., 3 continuous) 18 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.129323942 1.955283578 42.24% 0 0 0 0 0.0s R 0 0 0 0.00% 1.12932752 1.12932752 0.00% 0 0 0 4 0.0s Solving report Status Optimal Primal bound 1.12932752045 Dual bound 1.12932752044 Gap 0% (tolerance: 0.01%) Solution status feasible 1.12932752045 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.00 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 4 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:405 1.1293 - 0.4 FP: 0.3712761402130127 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.3 2 - 0 3 10.7 9.73 9.07% 0.3 - 87.4% #branches: 2 Obj: 10.700000447069831 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 223 #IntBinVar: 17 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.6476280689239502 Relaxation Obj: 15.877095202021701 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [2e-07, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 159 53.6 2617 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [2e-07, 1e+02] Presolving model 600 rows, 229 cols, 1610 nonzeros 0s 331 rows, 113 cols, 1184 nonzeros 0s 310 rows, 113 cols, 1100 nonzeros 0s Presolve : Reductions: rows 310(-586); columns 113(-144); elements 1100(-1373) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 5.8657355058e+00 Pr: 109(1144.49) 0s 114 5.8661839492e+00 0s Model status : Infeasible Simplex iterations: 114 Objective value : 5.8657669921e+00 HiGHS run time : 0.01 Presolving model 735 rows, 246 cols, 2160 nonzeros 0s 658 rows, 169 cols, 2198 nonzeros 0s 555 rows, 137 cols, 1848 nonzeros 0s Solving MIP model with: 555 rows 137 cols (16 binary, 0 integer, 2 implied int., 119 continuous) 1848 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.078975601 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 3.078975601 inf inf 0 0 6 137 0.0s C 0 0 0 0.00% 4.321525752 5.499231462 21.42% 141 9 31 236 0.1s L 0 0 0 0.00% 4.324154177 4.360247597 0.83% 159 15 31 252 0.1s Solving report Status Optimal Primal bound 4.36024759653 Dual bound 4.36024303044 Gap 0.000105% (tolerance: 0.01%) Solution status feasible 4.36024759653 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.14 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 343 (total) 0 (strong br.) 131 (separation) 58 (heuristics) 4.3602 1.6e-5 0.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [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 Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] 1.0121 1.3e-5 0.3 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 176 53.6 2623 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 843 rows, 314 cols, 2542 nonzeros 0s 736 rows, 229 cols, 2499 nonzeros 0s 668 rows, 150 cols, 1942 nonzeros 0s 581 rows, 149 cols, 1896 nonzeros 0s Solving MIP model with: 581 rows 149 cols (16 binary, 0 integer, 0 implied int., 133 continuous) 1896 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283881 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992459 0.0145090247 0.07% 0 0 0 164 0.0s Solving report Status Optimal Primal bound 0.0145090246953 Dual bound 0.0145090246953 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090246953 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 179 (total) 0 (strong br.) 15 (separation) 0 (heuristics) 0.0145 1.3e-5 0.6 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 180 53.6 2627 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 895 rows, 348 cols, 2831 nonzeros 0s 785 rows, 261 cols, 2771 nonzeros 0s 700 rows, 150 cols, 1943 nonzeros 0s 581 rows, 149 cols, 1896 nonzeros 0s Solving MIP model with: 581 rows 149 cols (16 binary, 0 integer, 0 implied int., 133 continuous) 1896 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283881 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992459 0.0145090247 0.07% 0 0 0 164 0.0s Solving report Status Optimal Primal bound 0.0145090246953 Dual bound 0.0145090246953 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090246953 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 179 (total) 0 (strong br.) 15 (separation) 0 (heuristics) 0.0145 1.3e-5 0.7 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.06169e-16, 6.06169e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.21234e-15, 1.21234e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.81851e-15, 1.81851e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 135 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 15] WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] WARNING: Row 66 has infeasibility of 53.6 from [lower, value, upper] = [ 0; -53.6; 0] Solution has num max sum Col infeasibilities 12 3.6 27 Integer infeasibilities 0 0 0 Row infeasibilities 184 53.6 2631 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 2e+02] Cost [1e+00, 1e+00] Bound [5e-02, 2e+01] RHS [9e-04, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 947 rows, 382 cols, 3188 nonzeros 0s 834 rows, 293 cols, 3107 nonzeros 0s 732 rows, 150 cols, 1943 nonzeros 0s 581 rows, 149 cols, 1896 nonzeros 0s Solving MIP model with: 581 rows 149 cols (16 binary, 0 integer, 0 implied int., 133 continuous) 1896 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00250283881 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0144992459 0.0145090247 0.07% 0 0 0 164 0.0s Solving report Status Optimal Primal bound 0.0145090246953 Dual bound 0.0145090246953 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0145090246953 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 179 (total) 0 (strong br.) 15 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 0.7331039905548096 s FP: 5 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 15.88 - 5.1 4 - 3 3 - 28.7 - 5.2 - 60.6% 4 4 - 28.9 - 5.4 - 67.9% 5 5 - 29.07 - 5.6 - 90.4% 6 5 - 29.49 - 5.8 - 77.0% 7 6 - 29.49 - 6.2 - 82.3% 8 6 - 29.53 - 6.4 - 83.7% 9 4 - 29.75 - 6.6 - 24.7% 10 5 - 29.78 - 6.8 - 89.1% 11 6 - 29.88 - 6.9 - 73.6% 12 7 - 29.94 - 7.1 - 60.4% 13 8 - 29.94 - 7.3 - 81.3% 13 7 - 30.08 - 7.6 - 90.4% 13 7 - 30.18 - 8.0 - 73.7% 13 7 - 30.3 - 8.4 - 91.5% 13 7 33.82 30.33 10.32% 8.6 - 93.0% 14 3 33.82 30.36 10.22% 8.8 - 80.6% 15 4 33.82 30.36 10.22% 9.0 - 88.2% 11 5 32.08 30.36 5.35% 9.3 - 89.6% 11 8 32.08 30.43 5.14% 9.5 - 96.1% 11 9 32.08 30.43 5.14% 9.7 - 90.6% 11 10 32.08 30.43 5.14% 9.8 - 95.9% 0 5 30.481486 30.481487 0.0% 10.1 - 92.0% #branches: 23 Obj: 30.481486163729333 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 114 #IntBinVar: 4 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.11723089218139648 Relaxation Obj: 0.6346232367287191 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [6e-06, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 3] WARNING: Col 88 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ -0.9; -3.6; -0.9] WARNING: Row 59 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 58 11.13 164.1 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [6e-06, 1e+02] Presolving model 199 rows, 101 cols, 624 nonzeros 0s 135 rows, 68 cols, 516 nonzeros 0s 123 rows, 62 cols, 493 nonzeros 0s Presolve : Reductions: rows 123(-192); columns 62(-60); elements 493(-416) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 2.0887776214e+00 Pr: 56(256.735) 0s 49 2.0888118163e+00 0s Model status : Infeasible Simplex iterations: 49 Objective value : 2.0887615136e+00 HiGHS run time : 0.00 Presolving model 231 rows, 104 cols, 729 nonzeros 0s 192 rows, 78 cols, 688 nonzeros 0s 173 rows, 69 cols, 620 nonzeros 0s Solving MIP model with: 173 rows 69 cols (3 binary, 0 integer, 0 implied int., 66 continuous) 620 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.177614989 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 1.383960841 inf inf 0 0 0 103 0.0s R 0 0 0 0.00% 2.200141205 2.733727506 19.52% 12 1 0 116 0.0s Solving report Status Optimal Primal bound 2.73372750635 Dual bound 2.73372750635 Gap 0% (tolerance: 0.01%) Solution status feasible 2.73372750635 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 116 (total) 0 (strong br.) 13 (separation) 0 (heuristics) 2.7337 6.0e-6 0.0 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [2e-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; 3] WARNING: Col 88 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ -0.9; -3.6; -0.9] WARNING: Row 59 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 60 11.13 165 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [2e-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 229 rows, 108 cols, 743 nonzeros 0s 199 rows, 81 cols, 719 nonzeros 0s 172 rows, 67 cols, 620 nonzeros 0s Solving MIP model with: 172 rows 67 cols (3 binary, 0 integer, 0 implied int., 64 continuous) 620 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 1.0017 5.0e-6 0.1 Coefficient ranges: Matrix [1e-03, 1e+02] 0.0043 5.0e-6 0.1 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [6.84598e-16, 6.84598e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.3692e-15, 1.3692e-15] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [2.0538e-15, 2.0538e-15] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Col 26 has infeasibility of 0.1 from [lower, value, upper] = [ 0.1; 0; 3] WARNING: Col 88 has infeasibility of 3.6 from [lower, value, upper] = [ 0; -3.6; 100] WARNING: Row 1 has infeasibility of 2.7 from [lower, value, upper] = [ -0.9; -3.6; -0.9] WARNING: Row 59 has infeasibility of 10.02 from [lower, value, upper] = [ 0; -10.0156; 0] Solution has num max sum Col infeasibilities 7 3.6 9.3 Integer infeasibilities 0 0 0 Row infeasibilities 66 11.13 172 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 1e+02] Cost [1e+00, 1e+00] Bound [1e-01, 1e+02] RHS [1e-01, 1e+02] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 249 rows, 120 cols, 833 nonzeros 0s 219 rows, 93 cols, 809 nonzeros 0s 173 rows, 68 cols, 630 nonzeros 0s 171 rows, 67 cols, 617 nonzeros 0s Solving MIP model with: 171 rows 67 cols (3 binary, 0 integer, 0 implied int., 64 continuous) 617 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.0042914883 inf inf 0 0 0 0 0.0s Solving report Status Optimal Primal bound 0.00429148830013 Dual bound 0.00429148830013 Gap 0% (tolerance: 0.01%) Solution status feasible 0.00429148830013 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 51 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 17.638906002044678 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.4 2 - 0 3 10.7 9.73 9.11% 0.5 - 87.0% #branches: 2 Obj: 10.700000760133749 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2 from [lower, value, upper] = [ -2; 0; -2] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 23 2 25.48 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 71 rows, 42 cols, 145 nonzeros 0s 21 rows, 13 cols, 51 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, 269 nonzeros 0s 58 rows, 31 cols, 197 nonzeros 0s 58 rows, 31 cols, 197 nonzeros 0s Solving MIP model with: 58 rows 31 cols (8 binary, 0 integer, 0 implied int., 23 continuous) 197 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -400 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 311.1639469 inf inf 0 0 0 34 0.0s S 0 0 0 0.00% 311.1639469 330.0287812 5.72% 15 1 0 34 0.0s L 0 0 0 0.00% 318.1522349 329.9545624 3.58% 15 1 0 39 0.0s 37.5% inactive integer columns, restarting Model after restart has 32 rows, 21 cols (3 bin., 0 int., 0 impl., 18 cont.), and 108 nonzeros 0 0 0 0.00% 318.1522349 329.9545624 3.58% 1 0 0 49 0.0s Solving report Status Optimal Primal bound 329.954562409 Dual bound 329.954562409 Gap 0% (tolerance: 0.01%) Solution status feasible 329.954562409 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 58 (total) 0 (strong br.) 5 (separation) 10 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 125 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.39838409423828125 Relaxation Obj: 333.01468808160837 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [6e-09, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2 from [lower, value, upper] = [ -2; 0; -2] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 18 2 18.03 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [6e-09, 2e+00] Presolving model 71 rows, 54 cols, 97 nonzeros 0s 2 rows, 12 cols, 8 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-137); columns 0(-141); elements 0(-283) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 3.7375769321e+00 HiGHS run time : 0.00 Presolving model 115 rows, 70 cols, 237 nonzeros 0s 66 rows, 39 cols, 154 nonzeros 0s 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.73757693211 Solving MIP model with: 22 rows 16 cols (6 binary, 0 integer, 3 implied int., 7 continuous) 50 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.7375769166 3.737576932 80.27% 0 0 0 0 0.0s T 0 0 0 0.00% 0.7375769166 0.7375775024 0.00% 0 0 0 9 0.0s Solving report Status Optimal Primal bound 0.737577502413 Dual bound 0.737577502413 Gap 0% (tolerance: 0.01%) Solution status feasible 0.737577502413 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 9 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.7376 0.0477 1.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [8e-04, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2 from [lower, value, upper] = [ -2; 0; -2] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 25 2 21.44 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [5e-01, 5e+00] Cost [1e+00, 1e+00] Bound [5e-01, 1e+01] RHS [8e-04, 2e+00] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 144 rows, 86 cols, 317 nonzeros 0s 93 rows, 55 cols, 228 nonzeros 0s 78 rows, 47 cols, 186 nonzeros 0s 62 rows, 39 cols, 154 nonzeros 0s 31 rows, 19 cols, 77 nonzeros 0s Solving MIP model with: 31 rows 19 cols (7 binary, 0 integer, 1 implied int., 11 continuous) 77 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.4399746026 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 1.113581153 1.114358592 0.07% 0 0 0 17 0.0s 57.1% inactive integer columns, restarting Solving report Status Optimal Primal bound 1.11435859151 Dual bound 1.11435859151 Gap 0% (tolerance: 0.01%) Solution status feasible 1.11435859151 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 0 LP iterations 17 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: NLP couldn't be solved to optimality └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:405 1.1144 - 6.6 FP: 6.627022981643677 s FP: 2 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 333.01 - 0.2 0 - 1 3 348.02 343.77 1.22% 0.3 - 74.2% 0 4 348.02 344.32 1.06% 0.4 - 45.1% #branches: 3 Obj: 348.021928178522 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 156 #IntBinVar: 8 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.38391804695129395 Relaxation Obj: 313.63056557370913 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [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 [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 Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [4e-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 2 from [lower, value, upper] = [ -2; 0; -2] WARNING: Row 31 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 89 50 2235 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [4e-08, 5e+01] Presolving model 411 rows, 141 cols, 1157 nonzeros 0s 297 rows, 92 cols, 968 nonzeros 0s 259 rows, 83 cols, 864 nonzeros 0s Presolve : Reductions: rows 259(-398); columns 83(-89); elements 864(-942) Solving the presolved LP Using EKK dual simplex solver - serial Iteration Objective Infeasibilities num(sum) 0 4.0741188187e+00 Pr: 90(856.743); Du: 0(3.28893e-12) 0s 79 4.0742236988e+00 0s Model status : Infeasible Simplex iterations: 79 Objective value : 4.0741441200e+00 HiGHS run time : 0.00 Presolving model 501 rows, 149 cols, 1482 nonzeros 0s 411 rows, 100 cols, 1263 nonzeros 0s 364 rows, 82 cols, 1215 nonzeros 0s Solving MIP model with: 364 rows 82 cols (8 binary, 0 integer, 2 implied int., 72 continuous) 1215 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.5062455144 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 0.7729976042 inf inf 0 0 7 88 0.0s R 0 0 0 0.00% 1.230010115 1.531645281 19.69% 68 1 7 103 0.0s 62.5% inactive integer columns, restarting Model after restart has 220 rows, 53 cols (3 bin., 0 int., 0 impl., 50 cont.), and 739 nonzeros 0 0 0 0.00% 1.230010115 1.531645281 19.69% 1 0 0 110 0.1s 0 0 0 0.00% 1.230010115 1.531645281 19.69% 1 1 2 129 0.1s Solving report Status Optimal Primal bound 1.53164528147 Dual bound 1.53164528147 Gap 0% (tolerance: 0.01%) Solution status feasible 1.53164528147 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 129 (total) 0 (strong br.) 15 (separation) 7 (heuristics) 1.5316 1.2e-5 0.1 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [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 [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] 1.0056 1.0e-5 0.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [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 [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 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 2 from [lower, value, upper] = [ -2; 0; -2] WARNING: Row 31 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 100 50 2243 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 555 rows, 181 cols, 1666 nonzeros 0s 466 rows, 134 cols, 1419 nonzeros 0s 370 rows, 83 cols, 1237 nonzeros 0s 350 rows, 83 cols, 1181 nonzeros 0s Solving MIP model with: 350 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1181 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00347179309 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819367264 0.00819744193 0.05% 0 0 0 87 0.0s 25.0% inactive integer columns, restarting Model after restart has 143 rows, 45 cols (0 bin., 0 int., 0 impl., 45 cont.), and 492 nonzeros 0 0 0 0.00% 0.00819744193 0.00819744193 0.00% 0 0 0 87 0.0s Solving report Status Optimal Primal bound 0.00819744193276 Dual bound 0.00819744193276 Gap 0% (tolerance: 0.01%) Solution status feasible 0.00819744193276 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 113 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.0082 1.0e-5 11.3 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [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 [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 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 2 from [lower, value, upper] = [ -2; 0; -2] WARNING: Row 31 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 5 0.9 4.5 Integer infeasibilities 0 0 0 Row infeasibilities 104 50 2247 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 580 rows, 197 cols, 1802 nonzeros 0s 490 rows, 150 cols, 1491 nonzeros 0s 370 rows, 83 cols, 1237 nonzeros 0s 350 rows, 83 cols, 1181 nonzeros 0s Solving MIP model with: 350 rows 83 cols (8 binary, 0 integer, 0 implied int., 75 continuous) 1181 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00347176666 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.00819361421 0.00819738345 0.05% 0 0 0 87 0.0s 25.0% inactive integer columns, restarting Model after restart has 143 rows, 45 cols (0 bin., 0 int., 0 impl., 45 cont.), and 492 nonzeros 0 0 0 0.00% 0.00819738345 0.00819738345 0.00% 0 0 0 87 0.0s Solving report Status Optimal Primal bound 0.00819738345213 Dual bound 0.00819738345213 Gap 0% (tolerance: 0.01%) Solution status feasible 0.00819738345213 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 113 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 11.348684072494507 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 313.63 - 1.5 0 - 3 3 - 317.71 - 1.8 - 71.7% 4 4 - 329.96 - 2.4 - 63.9% 0 5 333.1 331.65 0.44% 2.8 - 318.8% #branches: 4 Obj: 333.0951953926088 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 6e+00] Presolving model 114 rows, 73 cols, 244 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 178 rows, 90 cols, 448 nonzeros 0s 156 rows, 69 cols, 460 nonzeros 0s 90 rows, 62 cols, 298 nonzeros 0s 87 rows, 59 cols, 289 nonzeros 0s Solving MIP model with: 87 rows 59 cols (16 binary, 0 integer, 0 implied int., 43 continuous) 289 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 4.5 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 20.06401564 inf inf 0 0 0 45 0.0s R 0 0 0 0.00% 20.06401564 27.9331482 28.17% 72 2 0 47 0.0s L 0 0 0 0.00% 23.42573978 26.9331482 13.02% 289 30 0 102 0.1s L 0 0 0 0.00% 23.42573978 26.9331482 13.02% 289 11 0 181 0.1s B 7 0 3 25.00% 23.42573978 26.3331482 11.04% 296 11 10 553 0.1s Solving report Status Optimal Primal bound 26.3331482044 Dual bound 26.3331482044 Gap 0% (tolerance: 0.01%) Solution status feasible 26.3331482044 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.14 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 9 LP iterations 604 (total) 166 (strong br.) 57 (separation) 269 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 3e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [4e-01, 3e+01] Presolving model 118 rows, 75 cols, 256 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 187 rows, 93 cols, 474 nonzeros 0s 164 rows, 72 cols, 482 nonzeros 0s 107 rows, 67 cols, 355 nonzeros 0s 107 rows, 67 cols, 355 nonzeros 0s Solving MIP model with: 107 rows 67 cols (18 binary, 0 integer, 0 implied int., 49 continuous) 355 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 16.23419662 inf inf 0 0 0 45 0.0s C 0 0 0 0.00% 22.74323566 59.2331482 61.60% 217 17 0 87 0.0s L 0 0 0 0.00% 23.67110647 25.4220988 6.89% 374 30 0 105 0.1s 16.7% inactive integer columns, restarting Model after restart has 98 rows, 61 cols (15 bin., 0 int., 0 impl., 46 cont.), and 328 nonzeros 0 0 0 0.00% 23.76257596 25.4220988 6.53% 17 0 0 167 0.1s 0 0 0 0.00% 23.76257596 25.4220988 6.53% 17 11 0 223 0.1s 13.3% inactive integer columns, restarting Model after restart has 91 rows, 54 cols (13 bin., 0 int., 0 impl., 41 cont.), and 327 nonzeros 0 0 0 0.00% 24.29591832 25.4220988 4.43% 15 0 0 320 0.2s 0 0 0 0.00% 24.29591832 25.4220988 4.43% 15 15 0 359 0.2s 23.1% inactive integer columns, restarting Model after restart has 79 rows, 47 cols (10 bin., 0 int., 0 impl., 37 cont.), and 281 nonzeros 0 0 0 0.00% 25.05855462 25.4220988 1.43% 20 0 0 577 0.2s 0 0 0 0.00% 25.05855462 25.4220988 1.43% 20 19 0 610 0.2s L 0 0 0 0.00% 25.18611429 25.4220988 0.93% 40 23 1 617 0.2s 20.0% inactive integer columns, restarting Model after restart has 65 rows, 41 cols (8 bin., 0 int., 0 impl., 33 cont.), and 230 nonzeros 0 0 0 0.00% 25.18611429 25.4220988 0.93% 15 0 0 629 0.2s 0 0 0 0.00% 25.18611429 25.4220988 0.93% 15 15 0 653 0.2s H 0 0 0 0.00% 25.38238296 25.4220988 0.16% 146 35 0 697 0.2s Solving report Status Optimal Primal bound 25.4220988029 Dual bound 25.4220988029 Gap 0% (tolerance: 0.01%) Solution status feasible 25.4220988029 (objective) 0 (bound viol.) 6.48178158121e-13 (int. viol.) 0 (row viol.) Timing 0.25 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 763 (total) 0 (strong br.) 231 (separation) 332 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 5e+00] Bound [8e-01, 1e+01] RHS [1e-02, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 Coefficient ranges: Matrix [1e-02, 1e+02] Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [8e-01, 1e+01] RHS [1e-02, 2e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 1.2 from [lower, value, upper] = [ -2.4; -3.6; -2.4] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 81 7.473 232.3 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e+00, 1e+02] Cost [1e+00, 4e+00] Bound [8e-01, 1e+01] RHS [1e-02, 2e+00] Presolving model 57 rows, 46 cols, 140 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 79 rows, 57 cols, 206 nonzeros 0s 68 rows, 47 cols, 198 nonzeros 0s 54 rows, 34 cols, 154 nonzeros 0s 28 rows, 29 cols, 96 nonzeros 0s 26 rows, 27 cols, 102 nonzeros 0s Solving MIP model with: 26 rows 27 cols (11 binary, 0 integer, 0 implied int., 16 continuous) 102 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.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 20 0.0s L 0 0 0 0.00% 12.54216964 13.96629641 10.20% 66 5 2 35 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 74 nonzeros 0 0 0 0.00% 12.58451746 13.96629641 9.89% 5 0 0 50 0.0s 0 0 0 0.00% 12.58451746 13.96629641 9.89% 5 5 0 61 0.0s H 0 0 0 0.00% 13.28368884 13.36629641 0.62% 123 11 0 83 0.0s Solving report Status Optimal Primal bound 13.3662964088 Dual bound 13.3662964088 Gap 0% (tolerance: 0.01%) Solution status feasible 13.3662964088 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 95 (total) 0 (strong br.) 40 (separation) 24 (heuristics) Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+00] Bound [1e+00, 6e+00] RHS [1e+00, 6e+00] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2 from [lower, value, upper] = [ -2; 0; -2] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 46 2 50.96 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 2e+00] Bound [1e+00, 6e+00] RHS [1e+00, 6e+00] Presolving model 138 rows, 82 cols, 276 nonzeros 0s 29 rows, 19 cols, 74 nonzeros 0s Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 200 rows, 89 cols, 496 nonzeros 0s 166 rows, 55 cols, 508 nonzeros 0s 105 rows, 50 cols, 352 nonzeros 0s 105 rows, 50 cols, 352 nonzeros 0s Objective function is integral with scale 5 Solving MIP model with: 105 rows 50 cols (7 binary, 0 integer, 0 implied int., 43 continuous) 352 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s 14.3% inactive integer columns, restarting Model after restart has 83 rows, 40 cols (6 bin., 0 int., 0 impl., 34 cont.), and 311 nonzeros 0 0 0 0.00% 7.047647218 inf inf 0 0 0 46 0.0s 0 0 0 0.00% 7.047647218 inf inf 1 0 0 58 0.0s Solving report Status Optimal Primal bound 8.2 Dual bound 8.2 Gap 0% (tolerance: 0.01%) Solution status feasible 8.2 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.02 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 70 (total) 0 (strong br.) 12 (separation) 0 (heuristics) nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("tol") => 1.0e-6, MathOptInterface.RawOptimizerAttribute("print_level") => 0]) time_limit : 7200.0 mip_solver : MathOptInterface.OptimizerWithAttributes(HiGHS.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[]) log_levels : [:Options, :Table, :Info] #Variables: 294 #IntBinVar: 14 Obj Sense: Min Start values are not feasible. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.3123948574066162 Relaxation Obj: 5.656048595060804 MIPobj NLPobj Time ============================================= Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Coefficient ranges: 3.9849 1.9e-5 0.2 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [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 [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 [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 [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 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 2 from [lower, value, upper] = [ -2; 0; -2] WARNING: Row 30 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 197 50 4879 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1047 rows, 299 cols, 3114 nonzeros 0s 907 rows, 225 cols, 2692 nonzeros 0s 745 rows, 150 cols, 2411 nonzeros 0s 729 rows, 148 cols, 2328 nonzeros 0s Solving MIP model with: 729 rows 148 cols (6 binary, 0 integer, 0 implied int., 142 continuous) 2328 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00907880698 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.001858053 2.00761552 0.29% 0 0 0 178 0.0s Solving report Status Optimal Primal bound 2.00761551996 Dual bound 2.00761551996 Gap 0% (tolerance: 0.01%) Solution status feasible 2.00761551996 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 251 (total) 0 (strong br.) 6 (separation) 67 (heuristics) 2.0076 1.4e-5 4.5 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [1.64873e-16, 1.64873e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [3.29746e-16, 3.29746e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [4.94619e-16, 4.94619e-16] less than or equal to 1e-09: ignored WARNING: LP matrix packed vector contains 1 |values| in [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 [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 [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 [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 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 2 from [lower, value, upper] = [ -2; 0; -2] WARNING: Row 30 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 204 50 4884 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1090 rows, 327 cols, 3296 nonzeros 0s 949 rows, 253 cols, 2818 nonzeros 0s 748 rows, 152 cols, 2413 nonzeros 0s 732 rows, 150 cols, 2330 nonzeros 0s Solving MIP model with: 732 rows 150 cols (6 binary, 0 integer, 0 implied int., 144 continuous) 2330 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540629666 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129944971 0.0130004115 0.05% 0 0 0 143 0.0s 16.7% inactive integer columns, restarting Model after restart has 416 rows, 98 cols (0 bin., 0 int., 0 impl., 98 cont.), and 1289 nonzeros 0 0 0 0.00% 0.0130004115 0.0130004115 0.00% 0 0 0 143 0.0s Solving report Status Optimal Primal bound 0.0130004115195 Dual bound 0.0130004115195 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0130004115195 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.04 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 180 (total) 0 (strong br.) 0 (separation) 0 (heuristics) 0.013 1.4e-5 4.6 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms WARNING: LP matrix packed vector contains 1 |values| in [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 [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 [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 [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 [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 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 2 from [lower, value, upper] = [ -2; 0; -2] WARNING: Row 30 has infeasibility of 50 from [lower, value, upper] = [ 50; 0; 50] Solution has num max sum Col infeasibilities 10 0.9 9 Integer infeasibilities 0 0 0 Row infeasibilities 211 50 4891 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-03, 5e+01] Cost [1e+00, 1e+00] Bound [1e-01, 1e+01] RHS [9e-04, 5e+01] Presolving model Problem status detected on presolve: Infeasible Model status : Infeasible Objective value : 0.0000000000e+00 HiGHS run time : 0.00 Presolving model 1133 rows, 355 cols, 3534 nonzeros 0s 961 rows, 251 cols, 2977 nonzeros 0s 748 rows, 152 cols, 2413 nonzeros 0s 732 rows, 150 cols, 2330 nonzeros 0s Solving MIP model with: 732 rows 150 cols (6 binary, 0 integer, 0 implied int., 144 continuous) 2330 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.00540209548 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.0129827842 0.0129886871 0.05% 0 0 0 142 0.0s 16.7% inactive integer columns, restarting Model after restart has 416 rows, 98 cols (0 bin., 0 int., 0 impl., 98 cont.), and 1289 nonzeros 0 0 0 0.00% 0.0129886871 0.0129886871 0.00% 0 0 0 142 0.0s Solving report Status Optimal Primal bound 0.0129886871223 Dual bound 0.0129886871223 Gap 0% (tolerance: 0.01%) Solution status feasible 0.0129886871223 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.05 (total) 0.01 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 179 (total) 0 (strong br.) 0 (separation) 0 (heuristics) ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/yEX2j/src/fpump.jl:372 FP: 4.654040098190308 s FP: 4 rounds FP: No integral solution found ONodes CLevel Incumbent BestBound Gap Time Restarts GainGap ============================================================================================================ 2 2 - 5.66 - 3.6 1 - 2 3 - 7.38 - 4.2 - 66.8% 3 3 - 8.24 - 4.3 - 90.3% 3 4 - 8.24 - 4.7 - 3725.1% 3 5 - 8.24 - 5.1 - 82.1% 3 4 - 8.45 - 5.6 - 68.7% 3 5 - 8.95 - 6.0 - 81.4% 0 6 10.2 10.20001 0.0% 6.2 - 83.7% #branches: 8 Obj: 10.200001575489066 Running HiGHS 1.7.2 (git hash: 5ce7a2753): Copyright (c) 2024 HiGHS under MIT licence terms Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Assessing feasibility of MIP using primal feasibility and integrality tolerance of 1e-06 WARNING: Row 1 has infeasibility of 2 from [lower, value, upper] = [ -2; 0; -2] Solution has num max sum Col infeasibilities 0 0 0 Integer infeasibilities 0 0 0 Row infeasibilities 46 2 50.96 Row residuals 0 0 0 Attempting to find feasible solution for (partial) user-supplied values of discrete variables Coefficient ranges: Matrix [1e-02, 1e+02] Cost [1e+00, 1e+02] Bound [1e+00, 6e+00] RHS [1e+00, 1e+01] Presolving model 142 rows, 84 cols, 290 nonzeros 0s 43 rows, 27 cols, 104 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 183 rows, 61 cols, 526 nonzeros 0s 119 rows, 55 cols, 394 nonzeros 0s 116 rows, 54 cols, 394 nonzeros 0s Solving MIP model with: 116 rows 54 cols (8 binary, 0 integer, 0 implied int., 46 continuous) 394 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -800 inf inf 0 0 0 0 0.0s 0 0 0 0.00% 622.3278939 inf inf 1 0 0 64 0.0s S 0 0 0 0.00% 622.3278939 710.0575624 12.36% 37 3 0 64 0.0s L 0 0 0 0.00% 652.8479648 659.9091248 1.07% 37 3 0 81 0.0s Solving report Status Optimal Primal bound 659.909124818 Dual bound 659.909124818 Gap 0% (tolerance: 0.01%) Solution status feasible 659.909124818 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.03 (total) 0.00 (presolve) 0.00 (postsolve) Nodes 1 LP iterations 118 (total) 0 (strong br.) 23 (separation) 31 (heuristics) Test Summary: | Pass Total Time PowerModelsACDC | 296 296 9m43.1s Testing PowerModelsACDC tests passed Testing completed after 607.7s PkgEval succeeded after 860.77s