Package evaluation of Alpine on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T08:28:12.505 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 5.26s ################################################################################ # Installation # Installing Alpine... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [07493b3f] + Alpine v0.5.6 Updating `~/.julia/environments/v1.10/Manifest.toml` [07493b3f] + Alpine v0.5.6 [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.2 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [864edb3b] + DataStructures v0.18.20 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.3 [f6369f11] + ForwardDiff v0.10.38 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.1 [4076af6c] + JuMP v1.24.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.37.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.2 [bac558e1] + OrderedCollections v1.8.0 [69de0a69] + Parsers v2.8.1 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [276daf66] + SpecialFunctions v2.5.0 [1e83bf80] + StaticArraysCore v1.4.3 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [0dad84c5] + ArgTools v1.1.1 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [f43a241f] + Downloads v1.6.0 [7b1f6079] + FileWatching [b77e0a4c] + InteractiveUtils [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.10.0 [de0858da] + Printf [9abbd945] + Profile [3fa0cd96] + REPL [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] + LibCURL_jll v8.4.0+0 [e37daf67] + LibGit2_jll v1.6.4+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.2+1 [14a3606d] + MozillaCACerts_jll v2023.1.10 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.1+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 [8e850ede] + nghttp2_jll v1.52.0+1 [3f19e933] + p7zip_jll v17.4.0+2 Installation completed after 7.02s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 28.86s ################################################################################ # Testing # Testing Alpine Status `/tmp/jl_U7O3c5/Project.toml` [07493b3f] Alpine v0.5.6 [861a8166] Combinatorics v1.0.2 [87dc4568] HiGHS v1.13.0 [b6b21f68] Ipopt v1.7.2 [4076af6c] JuMP v1.24.0 [2ddba703] Juniper v0.9.2 [b8f27783] MathOptInterface v1.37.0 [cd433a01] Pavito v0.3.9 [37e2e46d] LinearAlgebra [44cfe95a] Pkg v1.10.0 [9a3f8284] Random [10745b16] Statistics v1.10.0 [8dfed614] Test Status `/tmp/jl_U7O3c5/Manifest.toml` [07493b3f] Alpine v0.5.6 [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.2 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [864edb3b] DataStructures v0.18.20 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.3 [f6369f11] ForwardDiff v0.10.38 [87dc4568] HiGHS v1.13.0 [b6b21f68] Ipopt v1.7.2 [92d709cd] IrrationalConstants v0.2.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.1 [4076af6c] JuMP v1.24.0 [2ddba703] Juniper v0.9.2 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.37.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.2 [bac558e1] OrderedCollections v1.8.0 [69de0a69] Parsers v2.8.1 [cd433a01] Pavito v0.3.9 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [276daf66] SpecialFunctions v2.5.0 [1e83bf80] StaticArraysCore v1.4.3 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.9.0+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.24+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [8ba89e20] Distributed [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.1+4 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 9 # NL Constraints = 8 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 12.79s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 25.73s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.44s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 2618.1981 | 62.858 | 0.05s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.44s | finish | 7446.9743 | 7049.2479 | 6424.1806 | 8.867 | 1.76s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 0 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 Completed presolve in 0.17s *** Alpine ended with status LOCALLY_SOLVED *** PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 0 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 Completed presolve in 0.08s *** Alpine ended with status LOCALLY_SOLVED *** PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 0 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 Completed presolve in 0.09s *** Alpine ended with status LOCALLY_SOLVED *** PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 26 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false Initial constraint-based bound evaluation exhausted... Warning: -/+Inf bounds detected on at least 40 variables. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 174 # Bin-Int Variables = 0 # Constraints = 152 # NL Constraints = 48 # Linear Constraints = 104 # Detected convex constraints = 0 # Detected nonlinear terms = 48 # Variables involved in nonlinear terms = 24 # Potential variables for partitioning = 12 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 227.981 Completed presolve in 0.77s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 227.981 | 227.981 | 108.1633 | 52.556 | 1.12s UPDATED DISC-VAR COUNT = 12 : [110, 111, 112, 113, 114, 115, 116, 117, 118, 122, 123, 124] | finish | 242.8322 | 227.981 | 145.8756 | 36.014 | 4.77s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 9 # NL Constraints = 8 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 6 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 8 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 213 # NL Constraints = 12 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 3 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 3 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 3 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 3 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 4 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 11 # NL Constraints = 5 # Linear Constraints = 6 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 9 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 6 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 15 # Variables involved in nonlinear terms = 12 # Potential variables for partitioning = 12 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 6 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 19 # Variables involved in nonlinear terms = 17 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 7 # NL Constraints = 7 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 11 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 9 # NL Constraints = 9 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 20 # Variables involved in nonlinear terms = 15 # Potential variables for partitioning = 15 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 CONVEX Objective: 1.0 * x[1] * x[1] + 1.0 * x[3] * x[3] CONVEX Constraint 1: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] <= 25.0 CONVEX Constraint 2: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] <= 25.0 CONVEX Constraint 4: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] <= 10.0 CONVEX Constraint 5: 3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] + 6.0 * x[3] * x[3] <= 10.0 CONVEX Constraint 8: (3.0 * x[1] ^ 3.0 + x[2] ^ 3.0 + 5.0 * x[3] ^ 3.0) - 200.0 <= 0.0 CONVEX Constraint 9: (1.0 * x[1] * x[1] * x[1] + 1.0 * x[2] * x[2] * x[2] + 1.0 * x[3] * x[3] * x[3] + 100.0 * x[4] * x[4] * x[4]) - 200.0 <= 0.0 CONVEX Constraint 10: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0 <= 0.0 CONVEX Constraint 11: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0 <= 0.0 CONVEX Constraint 12: ((3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0) - 0.0 <= 0.0 CONVEX Constraint 13: (-3.0 * x[1] * x[1] - 4.0 * x[2] * x[2]) - -25.0 >= 0.0 CONVEX Constraint 14: (3.0 * x[1] * x[1] + 1.0 * x[2] * (5.0 * x[2])) - 25.0 <= 0.0 CONVEX Constraint 15: (3.0 * x[1] * x[1] + 5.0 * x[2] * x[2] + x[4] ^ 2.0) - 25.0 <= 0.0 CONVEX Constraint 16: (4.0 * x[1] ^ 2.0 + 5.0 * x[2] ^ 2.0) - 25.0 <= 0.0 CONVEX Constraint 19: (3.0 * x[1] * x[1] + 16.0 * x[2] ^ 2.0) - 40.0 <= 0.0 CONVEX Constraint 22: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2] + 5.0 * x[3] * x[3] + 6.0 * x[4] * x[4]) - 15.0 <= 0.0 CONVEX Constraint 25: (x[1] ^ 2.0 + x[2] ^ 2.0 + x[3] ^ 2.0 + x[4] ^ 2.0 + x[5] ^ 2.0) - 99999.0 <= 0.0 CONVEX Constraint 26: (3.0 * x[1] ^ 4.0 + 4.0 * x[2] ^ 4.0) - 200.0 <= 0.0 CONVEX Constraint 27: ((3.0 * x[1] ^ 4.0 + 4.0 * x[2] * x[2] * x[2] * x[2]) - 200.0) - 0.0 <= 0.0 CONVEX Constraint 28: (3.0 * x[1] ^ 4.0 + 1.0 * x[2] * x[2] * (4.0 * x[2] ^ 2.0)) - 200.0 <= 0.0 PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 30 # NL Constraints = 30 # Linear Constraints = 0 # Detected convex constraints = 19 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 3 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 0 # NL Constraints = 0 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 8 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 3 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 9 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 Warning: -/+Inf bounds detected on at least 6907 variables. Initializing with values -/+1.0e6. This may affect global optimal values and run times. Automatically turning OFF 'partition_scaling_factor_branch' due to the size of the problem PROBLEM STATISTICS Objective sense = Min # Variables = 6907 # Bin-Int Variables = 0 # Constraints = 0 # NL Constraints = 0 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 52 # Variables involved in nonlinear terms = 53 # Potential variables for partitioning = 27 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 8 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS # Variables = 4 # Bin-Int Variables = 0 # Constraints = 80 # NL Constraints = 80 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 105 # Variables involved in nonlinear terms = 40 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 5 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 10 # Bin-Int Variables = 5 # Constraints = 8 # NL Constraints = 8 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Min # Variables = 10 # Bin-Int Variables = 5 # Constraints = 3 # NL Constraints = 3 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 6 # Potential variables for partitioning = 6 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PROBLEM STATISTICS Objective sense = Max # Variables = 2 # Bin-Int Variables = 1 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 0 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Starting bound-tightening Actual iterations (OBBT): 1 Post-presolve optimality gap: 0.0% Completed presolve in 25.31s *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 1 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 2 # Linear Constraints = 0 # Detected convex constraints = 1 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 1 # Potential variables for partitioning = 1 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search Local solver returns a feasible point with value 1.0 Starting bound-tightening Actual iterations (OBBT): 5 Post-presolve optimality gap: 382.887% Completed presolve in 23.19s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 1.0 | 1.0 | -2.8288 | 382.882 | 23.28s | 2 | - | 1.0 | -2.8285 | 382.85 | 23.36s | finish | -2.8284 | -2.8284 | -2.8285 | 0.003 | 23.37s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = All Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4179.1645 | 40.715 | 0.27s | finish | 7446.9743 | 7049.2479 | 5897.2165 | 16.343 | 1.14s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 3 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 2717.1317 | 61.455 | 0.03s | finish | - | 7049.2479 | 3106.3098 | 55.934 | 0.26s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 2 PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Starting bound-tightening + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 10000.0=>4762.2 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 10000.0=>5944.1 + VAR 3 LB contracted 1000.0=>1000.0 + VAR 3 UB contracted 10000.0=>5949.3 + VAR 4 LB contracted 10.0=>10.0 + VAR 4 UB contracted 390.0=>334.20000000000005 + VAR 5 LB contracted 10.0=>94.5 + VAR 5 UB contracted 780.0=>572.8000000000001 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>390.0 + VAR 7 LB contracted 10.0=>16.900000000000002 + VAR 7 UB contracted 780.0=>626.9000000000001 + VAR 8 LB contracted 10.0=>91.9 + VAR 8 UB contracted 880.0=>660.7 + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 4762.2=>4573.6 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 5944.1=>5547.8 + VAR 3 LB contracted 1000.0=>1000.0 + VAR 3 UB contracted 5949.3=>5913.3 + VAR 4 LB contracted 10.0=>10.0 + VAR 4 UB contracted 334.20000000000005=>332.40000000000003 + VAR 5 LB contracted 94.5=>150.20000000000002 + VAR 5 UB contracted 572.8000000000001=>551.0 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>390.0 + VAR 7 LB contracted 16.900000000000002=>35.4 + VAR 7 UB contracted 626.9000000000001=>571.1 + VAR 8 LB contracted 91.9=>168.0 + VAR 8 UB contracted 660.7=>638.7 Variables whose bounds were tightened: Actual iterations (OBBT): 2 VAR 5: 48.0% contraction |10.0 --> | 150.2 - 551.0 | <-- 780.0 | VAR 4: 15.0% contraction |10.0 --> | 10.0 - 332.4 | <-- 390.0 | VAR 7: 30.0% contraction |10.0 --> | 35.4 - 571.1 | <-- 780.0 | VAR 2: 49.0% contraction |1000.0 --> | 1000.0 - 5547.8 | <-- 10000.0 | VAR 8: 46.0% contraction |10.0 --> | 168.0 - 638.7 | <-- 880.0 | VAR 3: 45.0% contraction |1000.0 --> | 1000.0 - 5913.3 | <-- 10000.0 | VAR 1: 55.00000000000001% contraction |100.0 --> | 100.0 - 4573.6 | <-- 10000.0 | Post-presolve optimality gap: 57.188% Completed presolve in 0.47s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4993.3484 | 29.165 | 0.87s | finish | 8817.8682 | 7049.2479 | 6310.9733 | 10.473 | 2.66s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 2 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 2 PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Starting bound-tightening + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 10000.0=>3532.6000000000004 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 10000.0=>5749.5 + VAR 3 LB contracted 1000.0=>2516.6000000000004 + VAR 3 UB contracted 10000.0=>5884.0 + VAR 4 LB contracted 10.0=>10.0 + VAR 4 UB contracted 390.0=>264.1 + VAR 5 LB contracted 10.0=>250.10000000000002 + VAR 5 UB contracted 780.0=>378.90000000000003 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>390.0 + VAR 7 LB contracted 10.0=>77.30000000000001 + VAR 7 UB contracted 780.0=>352.0 + VAR 8 LB contracted 10.0=>350.1 + VAR 8 UB contracted 880.0=>470.40000000000003 + VAR 1 LB contracted 100.0=>100.0 + VAR 1 UB contracted 3532.6000000000004=>2268.7000000000003 + VAR 2 LB contracted 1000.0=>1000.0 + VAR 2 UB contracted 5749.5=>3851.7000000000003 + VAR 3 LB contracted 2516.6000000000004=>3177.1000000000004 + VAR 3 UB contracted 5884.0=>5766.700000000001 + VAR 4 LB contracted 10.0=>57.5 + VAR 4 UB contracted 264.1=>241.60000000000002 + VAR 5 LB contracted 250.10000000000002=>270.8 + VAR 5 UB contracted 378.90000000000003=>350.20000000000005 + VAR 6 LB contracted 10.0=>10.0 + VAR 6 UB contracted 390.0=>328.5 + VAR 7 LB contracted 77.30000000000001=>151.1 + VAR 7 UB contracted 352.0=>317.70000000000005 + VAR 8 LB contracted 350.1=>371.20000000000005 + VAR 8 UB contracted 470.40000000000003=>446.0 Variables whose bounds were tightened: Actual iterations (OBBT): 2 VAR 5: 90.0% contraction |10.0 --> | 270.8 - 350.2 | <-- 780.0 | VAR 4: 52.0% contraction |10.0 --> | 57.5 - 241.6 | <-- 390.0 | VAR 6: 16.0% contraction |10.0 --> | 10.0 - 328.5 | <-- 390.0 | VAR 7: 78.0% contraction |10.0 --> | 151.1 - 317.7 | <-- 780.0 | VAR 2: 68.0% contraction |1000.0 --> | 1000.0 - 3851.7 | <-- 10000.0 | VAR 8: 91.0% contraction |10.0 --> | 371.2 - 446.0 | <-- 880.0 | VAR 3: 71.0% contraction |1000.0 --> | 3177.1 - 5766.7 | <-- 10000.0 | VAR 1: 78.0% contraction |100.0 --> | 100.0 - 2268.7 | <-- 10000.0 | Post-presolve optimality gap: 7.222% Completed presolve in 7.0s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 6343.871 | 10.006 | 7.37s | finish | 7200.8409 | 7049.2479 | 6877.9116 | 2.431 | 9.3s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 12 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 58.3837 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 58.3837 | 58.3837 | 57.7725 | 1.047 | 0.39s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 14 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4249.2127 | 39.721 | 0.47s | 2 | 7226.7536 | 7049.2479 | 5641.8462 | 19.965 | 2.79s | 3 | - | 7049.2479 | 6540.1946 | 7.221 | 5.06s | finish | 7254.9412 | 7049.2479 | 6839.4877 | 2.976 | 14.25s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 6 Relative global optimality gap = 0.01% Partition scaling factor = 8 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1.3846 | 30.769 | 0.08s | 2 | 1.4142 | 1.4142 | 1.3846 | 2.093 | 0.15s | 3 | 1.4142 | 1.4142 | 1.4114 | 0.202 | 0.25s | 4 | 1.4142 | 1.4142 | 1.4114 | 0.202 | 0.39s | 5 | 1.4142 | 1.4142 | 1.4114 | 0.202 | 0.52s | finish | 1.4142 | 1.4142 | 1.414 | 0.014 | 0.64s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 4179.1645 | 40.715 | 0.51s | 2 | 7446.9743 | 7049.2479 | 5897.2165 | 16.343 | 1.25s | finish | - | 7049.2479 | 6654.6983 | 5.597 | 3.38s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 1.48s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1106.7368 | 99.819 | 4.33s | 2 | 2.0 | 2.0 | 79.4099 | 97.481 | 4.43s | 3 | 1.9102 | 2.0 | 17.2206 | 88.386 | 4.81s | finish | 1.6253 | 2.0 | 5.1847 | 61.425 | 7.93s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 11 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 2600.6779 | 99.923 | 0.02s | 2 | 2.0 | 2.0 | 231.6096 | 99.136 | 0.1s | 3 | 1.8932 | 2.0 | 31.5066 | 93.652 | 0.53s | finish | 1.0279 | 2.0 | 12.0495 | 83.402 | 1.18s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1716.8718 | 99.884 | 1.08s | 2 | 2.0 | 2.0 | 116.45 | 98.283 | 1.31s | 3 | 1.3036 | 2.0 | 20.1272 | 90.063 | 1.6s | finish | 1.6358 | 2.0 | 7.2445 | 72.393 | 3.93s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1145.3656 | 99.825 | 0.02s | 2 | 2.0 | 2.0 | 146.2847 | 98.633 | 0.11s | 3 | 1.6581 | 2.0 | 20.6737 | 90.326 | 0.5s | finish | 1.5935 | 2.0 | 8.509 | 76.496 | 2.73s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 11 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 2173.2429 | 99.908 | 0.04s | 2 | 1.5355 | 2.0 | 151.2878 | 98.678 | 0.1s | 3 | 1.2333 | 2.0 | 29.2411 | 93.16 | 0.42s | finish | 1.761 | 2.0 | 8.1611 | 75.494 | 3.1s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 5 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 0.9291 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 0.9291 | 0.9291 | 0.9291 | 0.0 | 0.02s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 1.49s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 71.906 | 97.219 | 1.54s | 2 | 2.0 | 2.0 | 15.1302 | 86.781 | 1.61s | 3 | 2.0 | 2.0 | 5.1976 | 61.521 | 1.77s | finish | 1.8729 | 2.0 | 2.8976 | 30.977 | 2.65s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 110.4708 | 98.19 | 0.02s | 2 | 2.0 | 2.0 | 23.3338 | 91.429 | 0.1s | 3 | 2.0 | 2.0 | 7.9925 | 74.976 | 0.27s | finish | 2.0 | 2.0 | 3.8551 | 48.121 | 0.67s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 4 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 4 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 75.1519 | 97.339 | 0.02s | 2 | 2.0 | 2.0 | 20.6138 | 90.298 | 0.08s | 3 | 1.9823 | 2.0 | 5.4363 | 63.21 | 0.23s | finish | 1.5645 | 2.0 | 3.5967 | 44.394 | 0.88s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 9 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 0 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 9 # Potential variables for partitioning = 9 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.0 Completed presolve in 0.01s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | 3.0 | 3.0 | 493.9224 | 99.393 | 0.02s | 2 | 3.0 | 3.0 | 52.1469 | 94.247 | 0.03s | finish | 3.0 | 3.0 | 12.0546 | 75.113 | 0.15s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3004.247 | 57.382 | 0.39s | 2 | - | 7049.2479 | 4896.6075 | 30.537 | 1.65s | finish | 7049.2479 | 7049.2479 | 5871.5307 | 16.707 | 3.59s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 18 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 4564.5646 | 35.247 | 0.39s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 BRANCH RATIO = 8, METRIC = 3819.0137412191916 || TIME = 0.37943315505981445 BRANCH RATIO = 10, METRIC = 4179.164520879309 || TIME = 0.2728879451751709 BRANCH RATIO = 12, METRIC = 4624.802867549727 || TIME = 0.6955239772796631 BRANCH RATIO = 14, METRIC = 4892.8577703100445 || TIME = 0.2045149803161621 BRANCH RATIO = 16, METRIC = 4703.605725826039 || TIME = 0.3211939334869385 BRANCH RATIO = 18, METRIC = 4564.564609540189 || TIME = 0.3651728630065918 BRANCH RATIO = 20, METRIC = 4458.109915572042 || TIME = 0.23516607284545898 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 14 Completed presolve in 2.49s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 4892.8578 | 30.59 | 3.26s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 42 # Bin-Int Variables = 0 # Constraints = 45 # NL Constraints = 12 # Linear Constraints = 33 # Detected convex constraints = 0 # Detected nonlinear terms = 12 # Variables involved in nonlinear terms = 10 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 130.7025 BRANCH RATIO = 8, METRIC = 117.91941897074425 || TIME = 0.14290404319763184 BRANCH RATIO = 10, METRIC = 117.30720065950948 || TIME = 0.09955596923828125 BRANCH RATIO = 12, METRIC = 117.4761639111994 || TIME = 0.13981008529663086 BRANCH RATIO = 14, METRIC = 117.49730354290222 || TIME = 0.15911507606506348 BRANCH RATIO = 16, METRIC = 117.51714020171161 || TIME = 0.14359593391418457 BRANCH RATIO = 18, METRIC = 117.53480603681477 || TIME = 0.17805099487304688 BRANCH RATIO = 20, METRIC = 117.57374191761738 || TIME = 0.19019412994384766 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 8 Completed presolve in 1.15s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 130.7025 | 130.7025 | 122.4188 | 6.338 | 1.58s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 0 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.0 BRANCH RATIO = 8, METRIC = 4.025156249999995 || TIME = 0.7449319362640381 BRANCH RATIO = 10, METRIC = 3.656099999999997 || TIME = 1.6726570129394531 BRANCH RATIO = 12, METRIC = 3.455624999999995 || TIME = 2.4798460006713867 BRANCH RATIO = 14, METRIC = 3.3347448979591885 || TIME = 2.0028879642486572 BRANCH RATIO = 16, METRIC = 3.256495839847318 || TIME = 2.3263261318206787 BRANCH RATIO = 18, METRIC = 3.299750000013379 || TIME = 1.9876549243927002 BRANCH RATIO = 20, METRIC = 3.456980192307876 || TIME = 1.3400380611419678 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 16 Completed presolve in 12.56s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 3.0 | 3.0 | 3.1057 | 3.405 | 19.32s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 0 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.0 BRANCH RATIO = 8, METRIC = 42.616654497606255 || TIME = 0.06395506858825684 BRANCH RATIO = 10, METRIC = 36.49851361082922 || TIME = 0.07560014724731445 BRANCH RATIO = 12, METRIC = 33.54779704916936 || TIME = 0.07288789749145508 BRANCH RATIO = 14, METRIC = 31.073171449650484 || TIME = 0.12330293655395508 BRANCH RATIO = 16, METRIC = 28.686171396116656 || TIME = 0.20104384422302246 BRANCH RATIO = 18, METRIC = 26.550806700734125 || TIME = 0.1221921443939209 BRANCH RATIO = 20, METRIC = 24.569442309794486 || TIME = 0.07506513595581055 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 20 Completed presolve in 0.74s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 3.0 | 3.0 | 3.326 | 9.802 | 4.83s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 BRANCH RATIO = 8, METRIC = 4.512012500000003 || TIME = 1.5741071701049805 BRANCH RATIO = 10, METRIC = 3.5887923199999996 || TIME = 1.308117151260376 BRANCH RATIO = 12, METRIC = 3.0962000000000103 || TIME = 2.2792201042175293 BRANCH RATIO = 14, METRIC = 3.1727918367356795 || TIME = 2.6844520568847656 BRANCH RATIO = 16, METRIC = 3.547533928571494 || TIME = 2.5258021354675293 BRANCH RATIO = 18, METRIC = 3.8557000000093193 || TIME = 1.8670201301574707 BRANCH RATIO = 20, METRIC = 4.112840000000206 || TIME = 2.316235065460205 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 12 Completed presolve in 14.57s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 2.0 | 2.0 | 2.7103 | 26.207 | 22.31s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 7 # Potential variables for partitioning = 7 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 BRANCH RATIO = 8, METRIC = 256.1741472550343 || TIME = 0.07264900207519531 BRANCH RATIO = 10, METRIC = 209.9471657004288 || TIME = 0.06981706619262695 BRANCH RATIO = 12, METRIC = 169.70604858406267 || TIME = 0.06617903709411621 BRANCH RATIO = 14, METRIC = 138.994673521231 || TIME = 0.1983640193939209 BRANCH RATIO = 16, METRIC = 115.97342016451215 || TIME = 0.11125516891479492 BRANCH RATIO = 18, METRIC = 98.52620058308165 || TIME = 0.11179399490356445 BRANCH RATIO = 20, METRIC = 84.53481726488263 || TIME = 0.24523186683654785 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 20 Completed presolve in 0.89s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 2.0 | 2.0 | 4.9851 | 59.88 | 5.34s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 7 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 0 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 11 # Potential variables for partitioning = 11 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor branch activated Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 BRANCH RATIO = 8, METRIC = 6.487399999999997 || TIME = 0.7051239013671875 BRANCH RATIO = 10, METRIC = 5.325017599999998 || TIME = 1.0278301239013672 BRANCH RATIO = 12, METRIC = 6.047969230769233 || TIME = 0.5826950073242188 BRANCH RATIO = 14, METRIC = 6.4116387820450775 || TIME = 1.0089221000671387 BRANCH RATIO = 16, METRIC = 5.713379995207209 || TIME = 2.18587589263916 BRANCH RATIO = 18, METRIC = 5.197792466318414 || TIME = 2.338676929473877 BRANCH RATIO = 20, METRIC = 4.803130895055474 || TIME = 3.082850933074951 RATIO BRANCHING OFF due to solution variance test passed. INCUMB_RATIO = 20 Completed presolve in 10.94s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 2.0 | 2.0 | 3.6234 | 44.803 | 14.96s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 10 # Bin-Int Variables = 5 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 0.3 Completed presolve in 2.73s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 0.3 | 0.3 | 0.3 | 0.0 | 3.13s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Max # Variables = 10 # Bin-Int Variables = 5 # Constraints = 1 # NL Constraints = 0 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 5 # Potential variables for partitioning = 5 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 4 Bound-tightening presolve = false Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 4 Using convhull_ebd formulation Encoding method = default Independent branching scheme = false Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 58.3837 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 58.3837 | 58.3837 | 52.9702 | 9.272 | 1.78s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 3 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 8 Using convhull_ebd formulation Encoding method = default Independent branching scheme = true Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 58.3837 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 58.3837 | 58.3837 | 57.012 | 2.349 | 0.22s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 10 Using convhull_ebd formulation Encoding method = default Independent branching scheme = true Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.17s | 2 | 7446.9743 | 7049.2479 | 6424.1806 | 8.867 | 2.03s | finish | 7141.5401 | 7049.2479 | 6893.2067 | 2.214 | 6.25s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 2 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 2 # Potential variables for partitioning = 2 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 6 Relative global optimality gap = 0.01% Partition scaling factor = 8 Using convhull_ebd formulation Encoding method = default Independent branching scheme = true Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 2.0 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 2.0 | 2.0 | 1.3846 | 30.769 | 0.12s | 2 | 1.4142 | 1.4142 | 1.3846 | 2.093 | 0.2s | 3 | 1.4142 | 1.4142 | 1.3846 | 2.093 | 0.31s | 4 | - | 1.4142 | 1.3846 | 2.093 | 0.41s | 5 | - | 1.4142 | 1.3846 | 2.093 | 0.53s | finish | - | 1.4142 | 1.4136 | 0.046 | 0.74s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 3 Relative global optimality gap = 0.01% Partition scaling factor = 10 Using convhull_ebd formulation Encoding method = default Independent branching scheme = false Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 2.13s | 2 | 7446.9743 | 7049.2479 | 6424.1806 | 8.867 | 5.45s | finish | 7141.5401 | 7049.2479 | 6893.2067 | 2.214 | 12.0s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Warning: -/+Inf bounds detected on at least 21 variables. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 76 # Bin-Int Variables = 0 # Constraints = 66 # NL Constraints = 18 # Linear Constraints = 48 # Detected convex constraints = 0 # Detected nonlinear terms = 18 # Variables involved in nonlinear terms = 12 # Potential variables for partitioning = 12 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search ┌ Warning: Warning: Presolve ends with local solver yielding OTHER_ERROR. └ @ Alpine ~/.julia/packages/Alpine/2DP5q/src/main_algorithm.jl:263 Completed presolve in 0.91s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | - | Inf | 69.2386 | LARGE | 0.93s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Max # Variables = 102 # Bin-Int Variables = 36 # Constraints = 225 # NL Constraints = 24 # Linear Constraints = 201 # Detected convex constraints = 0 # Detected nonlinear terms = 28 # Variables involved in nonlinear terms = 26 # Potential variables for partitioning = 10 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 3 Relative global optimality gap = 0.01% Potential variables chosen for partitioning = Minimum vertex cover Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search ┌ Warning: Infeasible NLP problem terminated with primal status: INFEASIBLE_POINT └ @ Pavito ~/.julia/packages/Pavito/IfONk/src/optimize.jl:702 ┌ Warning: Warning: Presolve ends with local solver yielding OTHER_ERROR. └ @ Alpine ~/.julia/packages/Alpine/2DP5q/src/main_algorithm.jl:263 Completed presolve in 0.99s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | 1 | - | -Inf | 14.0064 | LARGE | 1.43s | 2 | - | -Inf | 13.9694 | LARGE | 2.19s | finish | - | -Inf | 13.9694 | LARGE | 2.76s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** CONVEX Objective: 1.0 * x[1] * x[1] + 1.0 * x[3] * x[3] CONVEX Constraint 1: (3.0 * x[1] * x[1] + 4.0 * x[2] * x[2]) - 25.0 <= 0.0 CONVEX Constraint 2: (3.0 * (1.0 * x[1] * x[1]) + 4.0 * x[2] ^ 2.0) - 10.0 <= 0.0 CONVEX Constraint 3: (3.0 * x[1] ^ 2.0 + 4.0 * x[2] ^ 2.0 + 6.0 * x[3] ^ 2.0) - 10.0 <= 0.0 CONVEX Constraint 5: (-3.0 * x[1] * x[1] - 4.0 * x[2] * x[2]) - -25.0 >= 0.0 PROBLEM STATISTICS Objective sense = Max # Variables = 5 # Bin-Int Variables = 0 # Constraints = 5 # NL Constraints = 5 # Linear Constraints = 0 # Detected convex constraints = 4 # Detected nonlinear terms = 1 # Variables involved in nonlinear terms = 1 # Potential variables for partitioning = 1 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (upper-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 3.3333 Completed presolve in 0.05s UPPER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Upper Bound | Gap (%) | Time | finish | 3.3333 | 3.3333 | 3.3333 | 0.0 | 0.52s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.02s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 6561.7841 | 6.915 | 2.05s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Initial constraint-based bound evaluation exhausted... PROBLEM STATISTICS Objective sense = Min # Variables = 13 # Bin-Int Variables = 5 # Constraints = 9 # NL Constraints = 9 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 20 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE MINLP local solver = Pavito MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search ┌ Warning: Infeasible NLP problem terminated with primal status: INFEASIBLE_POINT └ @ Pavito ~/.julia/packages/Pavito/IfONk/src/optimize.jl:702 Local solver returns a feasible point with value 3651.0204 Completed presolve in 0.28s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | 3651.0204 | 3651.0204 | 3495.9592 | 4.247 | 0.79s | 2 | - | 3651.0204 | 3499.7471 | 4.143 | 1.47s | 3 | 3651.0204 | 3651.0204 | 3649.8107 | 0.033 | 2.78s | finish | 3651.0204 | 3651.0204 | 3650.7864 | 0.006 | 4.22s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 3 # NL Constraints = 1 # Linear Constraints = 2 # Detected convex constraints = 0 # Detected nonlinear terms = 2 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 2 PRESOLVE Doing local search Local solver returns a feasible point with value -18.0 Starting bound-tightening Actual iterations (OBBT): 1 Post-presolve optimality gap: 0.009% Completed presolve in 0.48s *** Alpine ended with status OPTIMAL *** Warning: -/+Inf bounds detected on at least 1 variable. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -0.5294 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | -0.5294 | -0.5294 | -0.7003 | 32.278 | 0.07s | finish | -0.407 | -0.5294 | -0.5294 | 0.0 | 0.48s ==================================================================================================== *** Alpine ended with status OPTIMAL *** Warning: -/+Inf bounds detected on at least 1 variable. Initializing with values -/+1.0e6. This may affect global optimal values and run times. PROBLEM STATISTICS Objective sense = Min # Variables = 5 # Bin-Int Variables = 0 # Constraints = 1 # NL Constraints = 1 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 6 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -0.5294 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | -0.5294 | -0.5294 | -0.5294 | 0.0 | 1.95s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value 7049.2479 Completed presolve in 0.01s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 3834.9781 | 45.597 | 0.44s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** PROBLEM STATISTICS Objective sense = Min # Variables = 8 # Bin-Int Variables = 0 # Constraints = 6 # NL Constraints = 3 # Linear Constraints = 3 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 8 # Potential variables for partitioning = 8 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 1 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search Using warm starting point as a local incumbent solution with value 7049.2479 Starting bound-tightening Actual iterations (OBBT): 23 Post-presolve optimality gap: 54.262% Completed presolve in 4.18s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 7049.2479 | 7049.2479 | 4810.213 | 31.763 | 4.48s ==================================================================================================== *** Alpine ended with status OTHER_LIMIT *** Warm start value used as the incumbent solution: Test Failed at /home/pkgeval/.julia/packages/Alpine/2DP5q/test/test_algorithm.jl:1010 Expression: isapprox(alp.best_bound, 4810.212866711817, atol = 1.0e-6) Evaluated: isapprox(4810.213049290536, 4810.212866711817; atol = 1.0e-6) Stacktrace: [1] macro expansion @ /opt/julia/share/julia/stdlib/v1.10/Test/src/Test.jl:672 [inlined] [2] macro expansion @ ~/.julia/packages/Alpine/2DP5q/test/test_algorithm.jl:1010 [inlined] [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.10/Test/src/Test.jl:1577 [inlined] [4] top-level scope @ ~/.julia/packages/Alpine/2DP5q/test/test_algorithm.jl:960 PROBLEM STATISTICS Objective sense = Min # Variables = 17 # Bin-Int Variables = 16 # Constraints = 8 # NL Constraints = 8 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/HBPrQ/src/fpump.jl:372 Local solver returns a feasible point with value 13.0 Completed presolve in 13.12s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | finish | 13.0 | 13.0 | 13.0 | 0.0 | 13.13s ==================================================================================================== *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 17 # Bin-Int Variables = 16 # Constraints = 8 # NL Constraints = 8 # Linear Constraints = 0 # Detected convex constraints = 0 # Detected nonlinear terms = 10 # Variables involved in nonlinear terms = 0 # Potential variables for partitioning = 0 SUB-SOLVERS USED BY ALPINE MINLP local solver = Juniper MIP solver = HiGHS ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = true Maximum iterations (OBBT) = 25 PRESOLVE Doing local search ┌ Warning: Cycle detected └ @ Juniper ~/.julia/packages/Juniper/HBPrQ/src/fpump.jl:372 Local solver returns a feasible point with value 13.0 Starting bound-tightening Actual iterations (OBBT): 1 Post-presolve optimality gap: 0.0% Completed presolve in 2.78s *** Alpine ended with status OPTIMAL *** PROBLEM STATISTICS Objective sense = Min # Variables = 3 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -190.0 Completed presolve in 0.03s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | -190.0 | -190.0 | -2057.2519 | 982.764 | 0.24s | 2 | -1004.7309 | -1004.7309 | -1121.8764 | 11.659 | 1.55s | 3 | - | -1004.7309 | -1116.7734 | 11.151 | 2.98s | 4 | -1004.7309 | -1004.7309 | -1028.763 | 2.392 | 4.73s | 5 | -1004.7309 | -1004.7309 | -1006.5607 | 0.182 | 6.67s ┌ Warning: mixed-integer cycling detected, terminating Pavito └ @ Pavito ~/.julia/packages/Pavito/IfONk/src/optimize.jl:488 | 6 | -1004.7309 | -1004.7309 | -1004.917 | 0.019 | 12.99s | finish | -1004.7309 | -1004.7309 | -1004.7456 | 0.001 | 16.37s ==================================================================================================== *** Alpine ended with status OPTIMAL *** x[1] = -10.0 x[2] = 15.25434 x[3] = -3.20347 PROBLEM STATISTICS Objective sense = Min # Variables = 3 # Bin-Int Variables = 0 # Constraints = 2 # NL Constraints = 1 # Linear Constraints = 1 # Detected convex constraints = 0 # Detected nonlinear terms = 5 # Variables involved in nonlinear terms = 4 # Potential variables for partitioning = 4 SUB-SOLVERS USED BY ALPINE NLP local solver = Ipopt MIP solver = Pavito ALPINE CONFIGURATION Alpine version = 0.5.6 Maximum iterations (lower-bounding MIPs) = 99 Relative global optimality gap = 0.01% Partition scaling factor = 10 Bound-tightening presolve = false PRESOLVE Doing local search Local solver returns a feasible point with value -190.0 Completed presolve in 0.03s LOWER-BOUNDING ITERATIONS ==================================================================================================== | Iter | Incumbent | Best Incumbent | Lower Bound | Gap (%) | Time | 1 | -190.0 | -190.0 | -2057.2519 | 982.764 | 0.21s | 2 | -1004.7309 | -1004.7309 | -1121.8764 | 11.659 | 1.31s | 3 | - | -1004.7309 | -1013.0998 | 0.833 | 5.02s | 4 | -1004.7309 | -1004.7309 | -1004.98 | 0.025 | 13.33s | finish | -1004.7309 | -1004.7309 | -1004.7525 | 0.002 | 46.26s ==================================================================================================== *** Alpine ended with status OPTIMAL *** Test Summary: | Pass Fail Total Time Alpine tests | 2449 1 2450 8m20.5s Optimizer loading tests | 2 2 47.8s Partitioning variable selection tests :: nlp3 | 20 20 54.9s Partitioning variable selection tests :: castro2m2 | 12 12 4.7s Partitioning variable selection tests :: blend029 | 12 12 11.1s Partitioning variable selection tests :: castro6m2 | 7 7 15.3s Hessians disabled with user-defined multivariate functions | 1 1 2.9s Expression Parsing || bilinear || Affine || exprs.jl | 72 72 0.2s Expression Parsing || bilinear || Affine || nlp1.jl | 8 8 2.3s Expression Parsing || bilinear || Affine || nlp3.jl | 48 48 0.3s Expression Parsing || bilinear || Simple || bi1.jl | 7 7 0.0s Expression Parsing || bilinear || Complex || blend029.jl | 86 86 6.9s Expression Parsing || multilinear || Simple || multi.jl | 197 197 1.8s Expression Parsing || bilinear || Complex-div || div.jl | 65 65 0.9s Expression Parsing || part1 | 23 23 0.1s Expression Parsing || part2 | 36 36 0.1s Expression Parsing || part3 | 44 44 0.1s Expression Parsing || part7 | 29 29 0.1s Expression Parsing || part8 | 29 29 0.1s Expression Parsing || Convex | 141 141 6.6s Expression Prasing || Linear Lifting | 638 638 2.6s Expression Parsing || Basic Multiplication Operators (Machine Generated for diffs) | 495 495 5.8s Expression Parsing || corner cases | 25 25 0.5s Expression Parsing || Discrete Multilinear | 118 118 1.8s Expr dereferencing for @NLexpression | 3 3 25.7s @NLexpression from quadratic @expression (Issue #221) | 17 17 24.2s Validation Test || AMP-TMC || basic solve || examples/nlp3.jl (2 iterations) | 3 3 1.4s Validation Test || AMP-TMC || minimum-vertex solving || examples/nlp3.jl (3 iterations) | 3 3 0.3s Validation Test || BT-AMP-TMC || basic solve || examples/nlp3.jl | 5 5 4.8s Validation Test || PBT-AMP-TMC || basic solve || examples/nlp3.jl | 2 2 9.4s Validation Test || AMP-CONV || basic solve || examples/nlp1.jl | 3 3 0.8s Validation Test || AMP-CONV || basic solve || examples/nlp3.jl | 3 3 14.3s Validation Test || AMP || basic solve || examples/circle.jl | 1 1 0.9s Validation Test || AMP-CONV-FACET || basic solve || examples/nlp3.jl | 3 3 3.5s Validation Test || AMP || multi4N || N = 2 || exprmode=1:11 | 10 10 19.2s Validation Test || AMP || multi2 || exprmode=1:11 | 5 5 0.4s Validation Test || AMP || multi3N || N = 2 || exprmode=1:11 | 9 9 4.4s Validation Test || AMP || multiKND || K = 3, N = 3, D = 0 | 3 3 0.6s Validation Test || AMP-CONV-FACET || basic solve || examples/nlp3.jl | 4 4 3.7s Validation Test || AMP || PARTITION-SCALING-FACTOR || examples/nlp3.jl | 2 2 0.5s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/nlp3.jl | 2 2 3.3s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/castro2m2.jl | 2 2 1.6s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi3N.jl exprmode=2 | 2 2 19.4s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi3N.jl exprmode=2 | 2 2 4.8s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi4N.jl exprmode=1 | 2 2 22.3s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi4N.jl exprmode=2 | 2 2 5.3s Validation Test || AMP || PARTITION-SCALING-FACTOR-BRANCH || examples/multi4N.jl exprmode=2 | 2 2 15.0s Operator :: bmpl && binlin && binprod solve test I | 11 11 3.6s Operator :: bmpl && binlin && binprod solve test II | 20 20 0.4s Embedding Test || AMP-CONV || basic solve || examples/nlp1.jl | 4 4 1.9s Embedding IBS Test || AMP-CONV || basic solve || examples/nlp1.jl | 4 4 0.3s Embedding IBS Test || AMP-CONV || basic solve || examples/nlp3.jl | 4 4 6.4s Embedding IBS Test || AMP || special problem || ... | 1 1 0.8s Embedding LINK Test || AMP-CONV || basic solve || examples/nlp3.jl | 3 3 12.0s Algorithm Logic Test || castro4m2 || 1 iteration || Error case | 1 1 4.2s Algorithm Logic Test || blend029_gl || 3 iterations || Infeasible Case | 3 3 2.9s Convex Model Solve | 1 1 0.9s Uniform partitioning | 1 1 2.2s Algorithm Test with binprod terms | 127 127 5.2s TESTS for closing the optimality gap in OBBT | 4 4 1.6s Linking constraints for multilinear terms | 14 14 3.2s Warm start value used as the incumbent solution | 7 1 8 8.0s Test binary multilinear product linearization | 6 6 21.4s Utility Function Tests: Solver identifier fetch | 3 3 0.1s Solver Funtion Tests :: Embedding | 26 26 0.5s Utility Function Tests: check_solution_history test | 4 4 1m03.3s ERROR: LoadError: Some tests did not pass: 2449 passed, 1 failed, 0 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Alpine/2DP5q/test/runtests.jl:55 Testing failed after 523.77s ERROR: LoadError: Package Alpine errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.10/Pkg/src/Types.jl:70 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{Pkg.Types.PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:2034 [3] test @ /opt/julia/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1915 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{Pkg.Types.PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::Base.PipeEndpoint}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.10/Pkg/src/API.jl:444 [5] test(pkgs::Vector{Pkg.Types.PackageSpec}; io::Base.PipeEndpoint, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.10/Pkg/src/API.jl:159 [6] test @ /opt/julia/share/julia/stdlib/v1.10/Pkg/src/API.jl:147 [inlined] [7] #test#74 @ /opt/julia/share/julia/stdlib/v1.10/Pkg/src/API.jl:146 [inlined] [8] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 575.99s: package has test failures