Package evaluation of LearningToOptimize on Julia 1.11.4 (a71dd056e0*) started at 2025-04-08T22:12:13.825 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.67s ################################################################################ # Installation # Installing LearningToOptimize... Resolving package versions... Updating `~/.julia/environments/v1.11/Project.toml` [e1d8bfa7] + LearningToOptimize v1.0.0 Updating `~/.julia/environments/v1.11/Manifest.toml` [621f4979] + AbstractFFTs v1.5.0 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.3.0 [66dad0bd] + AliasTables v1.1.3 [dce04be8] + ArgCheck v2.5.0 [69666777] + Arrow v2.8.0 [31f734f8] + ArrowTypes v2.3.0 [a9b6321e] + Atomix v1.1.1 [fbb218c0] + BSON v0.3.9 [198e06fe] + BangBang v0.4.4 [9718e550] + Baselet v0.1.1 [6e4b80f9] + BenchmarkTools v1.6.0 [c3b6d118] + BitIntegers v0.3.5 [fa961155] + CEnum v0.5.0 [336ed68f] + CSV v0.10.15 [324d7699] + CategoricalArrays v0.10.8 [082447d4] + ChainRules v1.72.3 [d360d2e6] + ChainRulesCore v1.25.1 [523fee87] + CodecBzip2 v0.8.5 [5ba52731] + CodecLz4 v0.4.6 [944b1d66] + CodecZlib v0.7.8 [6b39b394] + CodecZstd v0.8.6 [3da002f7] + ColorTypes v0.12.1 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [a33af91c] + CompositionsBase v0.1.2 [ed09eef8] + ComputationalResources v0.3.2 [f0e56b4a] + ConcurrentUtilities v2.5.0 [187b0558] + ConstructionBase v1.5.8 [6add18c4] + ContextVariablesX v0.1.3 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [a93c6f00] + DataFrames v1.7.0 [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [244e2a9f] + DefineSingletons v0.1.2 [8bb1440f] + DelimitedFiles v1.9.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [31c24e10] + Distributions v0.25.118 [ffbed154] + DocStringExtensions v0.9.4 [4e289a0a] + EnumX v1.0.5 [e2ba6199] + ExprTools v0.1.10 [cc61a311] + FLoops v0.2.2 [b9860ae5] + FLoopsBase v0.1.1 [5789e2e9] + FileIO v1.17.0 [48062228] + FilePathsBase v0.9.24 [1a297f60] + FillArrays v1.13.0 [53c48c17] + FixedPointNumbers v0.8.5 ⌅ [587475ba] + Flux v0.14.25 [f6369f11] + ForwardDiff v1.0.1 ⌅ [d9f16b24] + Functors v0.4.12 [0c68f7d7] + GPUArrays v11.2.2 [46192b85] + GPUArraysCore v0.2.0 [076d061b] + HashArrayMappedTries v0.2.0 [34004b35] + HypergeometricFunctions v0.3.28 [7869d1d1] + IRTools v0.4.14 [22cec73e] + InitialValues v0.3.1 [842dd82b] + InlineStrings v1.4.3 [3587e190] + InverseFunctions v0.1.17 [41ab1584] + InvertedIndices v1.3.1 [92d709cd] + IrrationalConstants v0.2.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [033835bb] + JLD2 v0.5.12 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.2 [4076af6c] + JuMP v1.25.0 [b14d175d] + JuliaVariables v0.2.4 [63c18a36] + KernelAbstractions v0.9.34 [929cbde3] + LLVM v9.2.0 [b964fa9f] + LaTeXStrings v1.4.0 [e1d8bfa7] + LearningToOptimize v1.0.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [c2834f40] + MLCore v1.0.0 ⌃ [7e8f7934] + MLDataDevices v1.5.3 [094fc8d1] + MLJFlux v0.6.5 [e80e1ace] + MLJModelInterface v1.11.0 [d8e11817] + MLStyle v0.4.17 [f1d291b0] + MLUtils v0.4.8 [1914dd2f] + MacroTools v0.5.15 [b8f27783] + MathOptInterface v1.38.1 [dbeba491] + Metalhead v0.9.5 [128add7d] + MicroCollections v0.2.0 [e1d29d7a] + Missings v1.2.0 [78c3b35d] + Mocking v0.8.1 [d8a4904e] + MutableArithmetics v1.6.4 [872c559c] + NNlib v0.9.30 [77ba4419] + NaNMath v1.1.3 [71a1bf82] + NameResolution v0.1.5 [0b1bfda6] + OneHotArrays v0.2.7 ⌅ [3bd65402] + Optimisers v0.3.4 [bac558e1] + OrderedCollections v1.8.0 [90014a1f] + PDMats v0.11.33 ⌅ [0ce4ce61] + ParametricOptInterface v0.8.2 [69de0a69] + Parsers v2.8.1 [570af359] + PartialFunctions v1.2.0 [2dfb63ee] + PooledArrays v1.4.3 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [8162dcfd] + PrettyPrint v0.2.0 [08abe8d2] + PrettyTables v2.4.0 [33c8b6b6] + ProgressLogging v0.1.4 [92933f4c] + ProgressMeter v1.10.4 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [c1ae055f] + RealDot v0.1.0 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [79098fc4] + Rmath v0.8.0 [30f210dd] + ScientificTypesBase v3.0.0 [7e506255] + ScopedValues v1.3.0 [6c6a2e73] + Scratch v1.2.1 [91c51154] + SentinelArrays v1.4.8 [efcf1570] + Setfield v1.1.2 [605ecd9f] + ShowCases v0.1.0 [699a6c99] + SimpleTraits v0.9.4 [a2af1166] + SortingAlgorithms v1.2.1 [dc90abb0] + SparseInverseSubset v0.1.2 [276daf66] + SpecialFunctions v2.5.0 [171d559e] + SplittablesBase v0.1.15 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [64bff920] + StatisticalTraits v3.4.0 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 [2913bbd2] + StatsBase v0.34.4 [4c63d2b9] + StatsFuns v1.4.0 [892a3eda] + StringManipulation v0.4.1 [354b36f9] + StringViews v1.3.4 [09ab397b] + StructArrays v0.7.1 [856f2bd8] + StructTypes v1.11.0 [dc5dba14] + TZJData v1.5.0+2025b [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.0 [f269a46b] + TimeZones v1.21.3 [3bb67fe8] + TranscodingStreams v0.11.3 [28d57a85] + Transducers v0.4.84 [013be700] + UnsafeAtomics v0.3.0 [ea10d353] + WeakRefStrings v1.4.2 [76eceee3] + WorkerUtilities v1.6.1 ⌅ [e88e6eb3] + Zygote v0.6.76 [700de1a5] + ZygoteRules v0.2.7 [6e34b625] + Bzip2_jll v1.0.9+0 [dad2f222] + LLVMExtra_jll v0.0.35+0 [5ced341a] + Lz4_jll v1.10.1+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+0 [3161d3a3] + Zstd_jll v1.5.7+1 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.6.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.11.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.11.0 [4607b0f0] + SuiteSparse [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] + LibCURL_jll v8.6.0+0 [e37daf67] + LibGit2_jll v1.7.2+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.6+0 [14a3606d] + MozillaCACerts_jll v2023.12.12 [4536629a] + OpenBLAS_jll v0.3.27+1 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.7.0+0 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 [8e850ede] + nghttp2_jll v1.59.0+0 [3f19e933] + p7zip_jll v17.4.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 5.63s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 632.11s ################################################################################ # Testing # Testing LearningToOptimize Status `/tmp/jl_46SC1i/Project.toml` [69666777] Arrow v2.8.0 [336ed68f] CSV v0.10.15 [61c947e1] Clarabel v0.10.0 [a93c6f00] DataFrames v1.7.0 [8bb1440f] DelimitedFiles v1.9.1 [31c24e10] Distributions v0.25.118 ⌅ [587475ba] Flux v0.14.25 [87dc4568] HiGHS v1.15.0 [b6b21f68] Ipopt v1.8.0 [4076af6c] JuMP v1.25.0 [e1d8bfa7] LearningToOptimize v1.0.0 [add582a8] MLJ v0.20.7 [094fc8d1] MLJFlux v0.6.5 [872c559c] NNlib v0.9.30 ⌅ [3bd65402] Optimisers v0.3.4 [07a8691f] PGLib v0.2.1 ⌅ [0ce4ce61] ParametricOptInterface v0.8.2 [c36e90e8] PowerModels v0.21.3 [10745b16] Statistics v1.11.1 ⌅ [e88e6eb3] Zygote v0.6.76 [37e2e46d] LinearAlgebra v1.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 Status `/tmp/jl_46SC1i/Manifest.toml` [47edcb42] ADTypes v1.14.0 [14f7f29c] AMD v0.5.3 [da404889] ARFFFiles v1.5.0 [621f4979] AbstractFFTs v1.5.0 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.3.0 [66dad0bd] AliasTables v1.1.3 [dce04be8] ArgCheck v2.5.0 [4fba245c] ArrayInterface v7.18.0 [69666777] Arrow v2.8.0 [31f734f8] ArrowTypes v2.3.0 [a9b6321e] Atomix v1.1.1 [fbb218c0] BSON v0.3.9 [198e06fe] BangBang v0.4.4 [9718e550] Baselet v0.1.1 [6e4b80f9] BenchmarkTools v1.6.0 [d1d4a3ce] BitFlags v0.1.9 [c3b6d118] BitIntegers v0.3.5 [fa961155] CEnum v0.5.0 [336ed68f] CSV v0.10.15 [324d7699] CategoricalArrays v0.10.8 [af321ab8] CategoricalDistributions v0.1.15 [082447d4] ChainRules v1.72.3 [d360d2e6] ChainRulesCore v1.25.1 [61c947e1] Clarabel v0.10.0 [523fee87] CodecBzip2 v0.8.5 [5ba52731] CodecLz4 v0.4.6 [944b1d66] CodecZlib v0.7.8 [6b39b394] CodecZstd v0.8.6 [3da002f7] ColorTypes v0.12.1 [861a8166] Combinatorics v1.0.2 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [a33af91c] CompositionsBase v0.1.2 [ed09eef8] ComputationalResources v0.3.2 [f0e56b4a] ConcurrentUtilities v2.5.0 [187b0558] ConstructionBase v1.5.8 [6add18c4] ContextVariablesX v0.1.3 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 [a93c6f00] DataFrames v1.7.0 [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [244e2a9f] DefineSingletons v0.1.2 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [a0c0ee7d] DifferentiationInterface v0.6.50 [b4f34e82] Distances v0.10.12 [31c24e10] Distributions v0.25.118 [ffbed154] DocStringExtensions v0.9.4 [792122b4] EarlyStopping v0.3.0 [4e289a0a] EnumX v1.0.5 [460bff9d] ExceptionUnwrapping v0.1.11 [e2ba6199] ExprTools v0.1.10 [cc61a311] FLoops v0.2.2 [b9860ae5] FLoopsBase v0.1.1 [33837fe5] FeatureSelection v0.2.2 [5789e2e9] FileIO v1.17.0 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.13.0 [6a86dc24] FiniteDiff v2.27.0 [53c48c17] FixedPointNumbers v0.8.5 ⌅ [587475ba] Flux v0.14.25 [f6369f11] ForwardDiff v1.0.1 ⌅ [d9f16b24] Functors v0.4.12 [0c68f7d7] GPUArrays v11.2.2 [46192b85] GPUArraysCore v0.2.0 [14197337] GenericLinearAlgebra v0.3.15 ⌅ [34c5aeac] HSL v0.4.3 [cd3eb016] HTTP v1.10.15 [076d061b] HashArrayMappedTries v0.2.0 [87dc4568] HiGHS v1.15.0 [34004b35] HypergeometricFunctions v0.3.28 [7869d1d1] IRTools v0.4.14 [2030c09a] InfrastructureModels v0.7.8 [22cec73e] InitialValues v0.3.1 [842dd82b] InlineStrings v1.4.3 [3587e190] InverseFunctions v0.1.17 [41ab1584] InvertedIndices v1.3.1 [b6b21f68] Ipopt v1.8.0 [92d709cd] IrrationalConstants v0.2.4 [b3c1a2ee] IterationControl v0.5.4 [82899510] IteratorInterfaceExtensions v1.0.0 [033835bb] JLD2 v0.5.12 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.2 [4076af6c] JuMP v1.25.0 [b14d175d] JuliaVariables v0.2.4 [63c18a36] KernelAbstractions v0.9.34 [929cbde3] LLVM v9.2.0 [b964fa9f] LaTeXStrings v1.4.0 [a5e1c1ea] LatinHypercubeSampling v1.9.0 ⌅ [92ad9a40] LearnAPI v0.1.0 [e1d8bfa7] LearningToOptimize v1.0.0 [d3d80556] LineSearches v7.3.0 [2ab3a3ac] LogExpFunctions v0.3.29 [e6f89c97] LoggingExtras v1.1.0 [c2834f40] MLCore v1.0.0 ⌃ [7e8f7934] MLDataDevices v1.5.3 ⌅ [64a0f543] MLFlowClient v0.5.1 [add582a8] MLJ v0.20.7 [45f359ea] MLJBalancing v0.1.5 ⌃ [a7f614a8] MLJBase v1.7.0 [50ed68f4] MLJEnsembles v0.4.3 [7b7b8358] MLJFlow v0.5.0 [094fc8d1] MLJFlux v0.6.5 [614be32b] MLJIteration v0.6.3 [e80e1ace] MLJModelInterface v1.11.0 [d491faf4] MLJModels v0.17.9 [03970b2e] MLJTuning v0.8.8 [d8e11817] MLStyle v0.4.17 [f1d291b0] MLUtils v0.4.8 [1914dd2f] MacroTools v0.5.15 [b8f27783] MathOptInterface v1.38.1 [739be429] MbedTLS v1.1.9 [f28f55f0] Memento v1.4.1 [dbeba491] Metalhead v0.9.5 [128add7d] MicroCollections v0.2.0 [e1d29d7a] Missings v1.2.0 [78c3b35d] Mocking v0.8.1 [d8a4904e] MutableArithmetics v1.6.4 [d41bc354] NLSolversBase v7.9.1 [2774e3e8] NLsolve v4.5.1 [872c559c] NNlib v0.9.30 [77ba4419] NaNMath v1.1.3 [71a1bf82] NameResolution v0.1.5 [0b1bfda6] OneHotArrays v0.2.7 [8b6db2d4] OpenML v0.3.2 [4d8831e6] OpenSSL v1.4.3 ⌅ [3bd65402] Optimisers v0.3.4 [bac558e1] OrderedCollections v1.8.0 [90014a1f] PDMats v0.11.33 [07a8691f] PGLib v0.2.1 [d96e819e] Parameters v0.12.3 ⌅ [0ce4ce61] ParametricOptInterface v0.8.2 ⌅ [46dd5b70] Pardiso v0.5.0 [69de0a69] Parsers v2.8.1 [570af359] PartialFunctions v1.2.0 [2dfb63ee] PooledArrays v1.4.3 [c36e90e8] PowerModels v0.21.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [8162dcfd] PrettyPrint v0.2.0 [54e16d92] PrettyPrinting v0.4.2 [08abe8d2] PrettyTables v2.4.0 [33c8b6b6] ProgressLogging v0.1.4 [92933f4c] ProgressMeter v1.10.4 [43287f4e] PtrArrays v1.3.0 [bfc457fd] QDLDL v0.4.1 [1fd47b50] QuadGK v2.11.2 [c1ae055f] RealDot v0.1.0 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [05181044] RelocatableFolders v1.0.1 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.8.0 [321657f4] ScientificTypes v3.1.0 [30f210dd] ScientificTypesBase v3.0.0 [7e506255] ScopedValues v1.3.0 [6c6a2e73] Scratch v1.2.1 [91c51154] SentinelArrays v1.4.8 [efcf1570] Setfield v1.1.2 [605ecd9f] ShowCases v0.1.0 [777ac1f9] SimpleBufferStream v1.2.0 [699a6c99] SimpleTraits v0.9.4 [66db9d55] SnoopPrecompile v1.0.3 [a2af1166] SortingAlgorithms v1.2.1 [dc90abb0] SparseInverseSubset v0.1.2 [276daf66] SpecialFunctions v2.5.0 [171d559e] SplittablesBase v0.1.15 [860ef19b] StableRNGs v1.0.2 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 ⌅ [a19d573c] StatisticalMeasures v0.1.7 [c062fc1d] StatisticalMeasuresBase v0.1.2 [64bff920] StatisticalTraits v3.4.0 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 [2913bbd2] StatsBase v0.34.4 [4c63d2b9] StatsFuns v1.4.0 [892a3eda] StringManipulation v0.4.1 [354b36f9] StringViews v1.3.4 [09ab397b] StructArrays v0.7.1 [856f2bd8] StructTypes v1.11.0 [dc5dba14] TZJData v1.5.0+2025b [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.0 [f269a46b] TimeZones v1.21.3 [a759f4b9] TimerOutputs v0.5.28 [3bb67fe8] TranscodingStreams v0.11.3 [28d57a85] Transducers v0.4.84 [5c2747f8] URIs v1.5.2 [3a884ed6] UnPack v1.0.2 [013be700] UnsafeAtomics v0.3.0 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 ⌅ [e88e6eb3] Zygote v0.6.76 [700de1a5] ZygoteRules v0.2.7 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [017b0a0e] HSL_jll v4.0.2+0 [8fd58aa0] HiGHS_jll v1.10.0+0 [e33a78d0] Hwloc_jll v2.12.0+0 [1d5cc7b8] IntelOpenMP_jll v2025.0.4+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [dad2f222] LLVMExtra_jll v0.0.35+0 [5ced341a] Lz4_jll v1.10.1+0 [d00139f3] METIS_jll v5.1.3+0 [856f044c] MKL_jll v2025.0.1+1 [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [458c3c95] OpenSSL_jll v3.0.16+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+0 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [3161d3a3] Zstd_jll v1.5.7+1 [1317d2d5] oneTBB_jll v2022.0.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.11.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [3fa0cd96] REPL v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.11.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.7.2+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.6+0 [14a3606d] MozillaCACerts_jll v2023.12.12 [4536629a] OpenBLAS_jll v0.3.27+1 [05823500] OpenLibm_jll v0.8.5+0 [bea87d4a] SuiteSparse_jll v7.7.0+0 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.59.0+0 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... Precompiling HiGHS... 1386.2 ms ✓ HiGHS_jll 44073.8 ms ✓ HiGHS 2 dependencies successfully precompiled in 48 seconds. 50 already precompiled. Precompiling Ipopt... 40513.8 ms ✓ Ipopt 1 dependency successfully precompiled in 43 seconds. 71 already precompiled. Precompiling MLJ... 6801.1 ms ✓ OpenML 2414.9 ms ✓ LatinHypercubeSampling 10249.4 ms ✓ ScientificTypes 16534.5 ms ✓ StatisticalMeasuresBase 10563.4 ms ✓ CategoricalDistributions 45691.5 ms ✓ StatisticalMeasures 28458.9 ms ✓ MLJModels 20111.1 ms ✓ MLJBase 13457.3 ms ✓ MLJEnsembles 9670.6 ms ✓ StatisticalMeasures → ScientificTypesExt 11184.3 ms ✓ MLJBalancing 8211.9 ms ✓ MLJBase → DefaultMeasuresExt 15935.8 ms ✓ MLJIteration 14059.2 ms ✓ MLJFlow 14593.3 ms ✓ MLJTuning 22235.1 ms ✓ MLJ 16 dependencies successfully precompiled in 256 seconds. 189 already precompiled. Precompiling HTTPExt... 4871.7 ms ✓ FileIO → HTTPExt 1 dependency successfully precompiled in 5 seconds. 43 already precompiled. Precompiling PGLib... 16636.5 ms ✓ InfrastructureModels 3437.7 ms ✓ NLsolve 30752.2 ms ✓ PowerModels 9989.6 ms ✓ PGLib 4 dependencies successfully precompiled in 64 seconds. 79 already precompiled. Precompiling ZygoteDistancesExt... 11554.5 ms ✓ GPUArrays 6636.5 ms ✓ Zygote → ZygoteDistancesExt 2 dependencies successfully precompiled in 20 seconds. 106 already precompiled. Precompiling DifferentiationInterfaceZygoteExt... 4046.2 ms ✓ DifferentiationInterface → DifferentiationInterfaceZygoteExt 1 dependency successfully precompiled in 6 seconds. 111 already precompiled. ┌ Warning: `MvNormal(μ::AbstractVector{<:Real}, σ::Real)` is deprecated, use `MvNormal(μ, σ ^ 2 * I)` instead. │ caller = ip:0x0 └ @ Core :-1 ┌ Warning: No functional GPU backend found! Defaulting to CPU. │ │ 1. If no GPU is available, nothing needs to be done. │ 2. If GPU is available, load the corresponding trigger package. │ a. `CUDA.jl` and `cuDNN.jl` (or just `LuxCUDA.jl`) for NVIDIA CUDA Support. │ b. `AMDGPU.jl` for AMD GPU ROCM Support. │ c. `Metal.jl` for Apple Metal GPU Support. (Experimental) │ d. `oneAPI.jl` for Intel oneAPI GPU Support. (Experimental) └ @ MLDataDevices.Internal ~/.julia/packages/MLDataDevices/hoL1S/src/internal.jl:94 ┌ Warning: Layer with Float32 parameters got Float64 input. │ The input will be converted, but any earlier layers may be very slow. │ layer = Dense(10 => 1) # 11 parameters │ summary(x) = "10×32 Matrix{Float64}" └ @ Flux ~/.julia/packages/Flux/vwk6M/src/layers/stateless.jl:59 Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [3e-02, 1e+10] Cost [2e-01, 5e-01] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 8 rows, 7 cols, 28 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.386635435 inf inf 0 0 0 0 0.1s T 0 0 0 0.00% 1.386635435 1.472473489 5.83% 0 0 0 1 0.1s 1 0 1 100.00% 1.472473489 1.472473489 0.00% 0 0 0 1 0.1s Solving report Status Optimal Primal bound 1.47247348865 Dual bound 1.47247348865 Gap 0% (tolerance: 0.01%) P-D integral 0.00020864646449 Solution status feasible 1.47247348865 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.14 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [2e-01, 1e+10] Cost [5e-01, 8e-01] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 8 rows, 8 cols, 29 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 0 0 0.00% 0 0 0 0 0.0s 1 0 1 100.00% 0 0 0.00% 0 0 0 0 0.0s Solving report Status Optimal Primal bound 0 Dual bound 0 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 0 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 0 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [6e-02, 1e+10] Cost [3e-01, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 8 rows, 8 cols, 29 nonzeros 0s 6 rows, 6 cols, 22 nonzeros 0s 4 rows, 4 cols, 12 nonzeros 0s 2 rows, 3 cols, 6 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve: Optimal Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 3.72043868 3.72043868 0.00% 0 0 0 0 0.0s Solving report Status Optimal Primal bound 3.72043868001 Dual bound 3.72043868001 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 3.72043868001 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.00 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 0 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 0 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-01, 1e+10] Cost [4e-04, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 8 rows, 7 cols, 28 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 0.3821556191 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 0.8609845792 0.8619252734 0.11% 0 0 0 3 0.0s 1 0 1 100.00% 0.861923556 0.8619252734 0.00% 5 2 0 7 0.0s Solving report Status Optimal Primal bound 0.861925273362 Dual bound 0.861923555956 Gap 0.000199% (tolerance: 0.01%) P-D integral 1.02782251842e-06 Solution status feasible 0.861925273362 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 7 (total) 0 (strong br.) 4 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-02, 1e+10] Cost [6e-02, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 8 rows, 7 cols, 28 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -3.65240177 inf inf 0 0 0 0 0.0s R 0 0 0 100.00% -3.539710225 -3.500769398 1.11% 0 0 0 4 0.0s 1 0 1 100.00% -3.500769398 -3.500769398 0.00% 0 0 0 4 0.0s Solving report Status Optimal Primal bound -3.50076939837 Dual bound -3.50076939837 Gap 0% (tolerance: 0.01%) P-D integral 1.47984407126e-06 Solution status feasible -3.50076939837 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 4 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [1e-02, 1e+10] Cost [8e-01, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.65504476 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% 2.100519432 3.128911127 32.87% 0 0 0 2 0.0s C 0 0 0 0.00% 2.998165996 3.128911127 4.18% 1 1 0 5 0.0s H 0 0 0 100.00% 2.998165996 2.999914331 0.06% 1 1 0 5 0.0s 1 0 1 100.00% 2.999914331 2.999914331 0.00% 1 1 0 8 0.0s Solving report Status Optimal Primal bound 2.99991433069 Dual bound 2.99991433069 Gap 0% (tolerance: 0.01%) P-D integral 0.000481522130694 Solution status feasible 2.99991433069 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 8 (total) 0 (strong br.) 3 (separation) 3 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [3e-02, 1e+10] Cost [4e-01, 9e-01] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 8 rows, 8 cols, 29 nonzeros 0s 7 rows, 6 cols, 23 nonzeros 0s 5 rows, 5 cols, 17 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% 1.174318764 inf inf 0 0 0 0 0.0s T 0 0 0 100.00% 1.174318764 1.174318764 0.00% 0 0 0 1 0.0s 1 0 1 100.00% 1.174318764 1.174318764 0.00% 0 0 0 1 0.0s Solving report Status Optimal Primal bound 1.17431876407 Dual bound 1.17431876407 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 1.17431876407 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 1 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [2e-02, 1e+10] Cost [6e-02, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 7 rows, 6 cols, 23 nonzeros 0s 5 rows, 5 cols, 17 nonzeros 0s 4 rows, 5 cols, 14 nonzeros 0s Solving MIP model with: 4 rows 5 cols (1 binary, 0 integer, 0 implied int., 4 continuous) 14 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -5.167133893 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% -4.260739906 -3.435567013 24.02% 0 0 0 4 0.0s T 0 0 0 0.00% -4.260739906 -3.435567013 24.02% 0 0 0 5 0.0s 1 0 1 100.00% -3.435567013 -3.435567013 0.00% 0 0 0 5 0.0s Solving report Status Optimal Primal bound -3.43556701318 Dual bound -3.43556701318 Gap 0% (tolerance: 0.01%) P-D integral 0.000103248167104 Solution status feasible -3.43556701318 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 5 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [5e-02, 1e+10] Cost [5e-01, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 7 rows, 7 cols, 25 nonzeros 0s Solving MIP model with: 7 rows 7 cols (2 binary, 0 integer, 0 implied int., 5 continuous) 25 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -3.186301848 inf inf 0 0 0 0 0.0s R 0 0 0 0.00% -2.955774746 -2.513233079 17.61% 0 0 0 6 0.0s 1 0 1 100.00% -2.513233079 -2.513233079 0.00% 0 0 0 11 0.0s Solving report Status Optimal Primal bound -2.51323307862 Dual bound -2.51323307862 Gap 0% (tolerance: 0.01%) P-D integral 6.98577860565e-05 Solution status feasible -2.51323307862 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 11 (total) 0 (strong br.) 0 (separation) 0 (heuristics) Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms MIP has 10 rows; 9 cols; 36 nonzeros; 3 integer variables (3 binary) Coefficient ranges: Matrix [4e-02, 1e+10] Cost [4e-01, 1e+00] Bound [1e+00, 2e+00] RHS [1e+01, 1e+10] Presolving model 10 rows, 9 cols, 36 nonzeros 0s 10 rows, 9 cols, 36 nonzeros 0s Solving MIP model with: 10 rows 9 cols (3 binary, 0 integer, 0 implied int., 6 continuous) 36 nonzeros Src: B => Branching; C => Central rounding; F => Feasibility pump; H => Heuristic; L => Sub-MIP; P => Empty MIP; R => Randomized rounding; S => Solve LP; T => Evaluate node; U => Unbounded; z => Trivial zero; l => Trivial lower; u => Trivial upper; p => Trivial point; X => User solution Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Src Proc. InQueue | Leaves Expl. | BestBound BestSol Gap | Cuts InLp Confl. | LpIters Time 0 0 0 0.00% -1.355185409 inf inf 0 0 0 0 0.0s 0 0 0 0.00% -0.760668388 inf inf 0 0 3 4 0.0s R 0 0 0 0.00% -0.4242403165 0 Large 9 1 3 6 0.0s 1 0 1 100.00% 0 0 0.00% 13 2 3 7 0.0s Solving report Status Optimal Primal bound 0 Dual bound 0 Gap 0% (tolerance: 0.01%) P-D integral 0 Solution status feasible 0 (objective) 0 (bound viol.) 0 (int. viol.) 0 (row viol.) Timing 0.01 (total) 0.00 (presolve) 0.00 (solve) 0.00 (postsolve) Max sub-MIP depth 0 Nodes 1 Repair LPs 0 (0 feasible; 0 iterations) LP iterations 7 (total) 0 (strong br.) 3 (separation) 0 (heuristics) ┌ Warning: All ids are ignored └ @ LearningToOptimize ~/.julia/packages/LearningToOptimize/zmKk4/src/datasetgen.jl:201 [ Info: Saving CSV file to /tmp/jl_siqC7o/pglib_opf_case5_pjm_DCPPowerModel_POI_load_input_4eb2045c-14ca-11f0-1250-7ba1ed858b31.csv - Mode: write ┌ Warning: All ids are ignored └ @ LearningToOptimize ~/.julia/packages/LearningToOptimize/zmKk4/src/datasetgen.jl:201 [ Info: Saving CSV file to /tmp/jl_siqC7o/test_5d8a4340-14ca-11f0-2618-751edf0cae59_input.csv - Mode: write Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-1); columns 0(-1); elements 0(-1) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 [ Info: Recorded 10.0 % of 10 problems LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [0e+00, 0e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 0.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -6.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -8.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [5e+00, 5e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.0000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [6e+00, 6e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.2000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [7e+00, 7e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.4000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 [ Info: Recorded 100.0 % of 10 problems LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [0e+00, 0e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 0.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -6.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -8.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [5e+00, 5e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.0000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [6e+00, 6e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.2000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [7e+00, 7e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.4000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 [ Info: Recorded 100.0 % of 10 problems Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-1); columns 0(-1); elements 0(-1) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 [ Info: Recorded 10.0 % of 10 problems LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [0e+00, 0e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 0.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -6.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -8.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [5e+00, 5e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.0000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [6e+00, 6e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.2000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [7e+00, 7e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.4000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 [ Info: Recorded 100.0 % of 10 problems LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [0e+00, 0e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 0.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [1e+00, 1e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [2e+00, 2e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -6.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [4e+00, 4e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -8.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [5e+00, 5e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.0000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [6e+00, 6e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.2000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 1 cols; 1 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [0e+00, 0e+00] RHS [7e+00, 7e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.4000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 [ Info: Recorded 100.0 % of 10 problems Running HiGHS 1.10.0 (git hash: fd8665394e): Copyright (c) 2025 HiGHS under MIT licence terms LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [1e+00, 1e+00] RHS [3e+00, 3e+00] Presolving model 0 rows, 0 cols, 0 nonzeros 0s 0 rows, 0 cols, 0 nonzeros 0s Presolve : Reductions: rows 0(-1); columns 0(-2); elements 0(-2) - Reduced to empty Solving the original LP from the solution after postsolve Model status : Optimal Objective value : 4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [2e+00, 2e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [3e+00, 3e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : 0.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [4e+00, 4e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -2.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [5e+00, 5e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -4.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [6e+00, 6e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -6.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [7e+00, 7e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -8.0000000000e+00 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [8e+00, 8e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.0000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [9e+00, 9e+00] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.2000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 LP has 1 rows; 2 cols; 2 nonzeros Coefficient ranges: Matrix [1e+00, 1e+00] Cost [2e+00, 2e+00] Bound [1e+01, 1e+01] RHS [3e+00, 3e+00] Solving LP without presolve, or with basis, or unconstrained Model status : Optimal Objective value : -1.4000000000e+01 Relative P-D gap : 0.0000000000e+00 HiGHS run time : 0.00 [ Info: Recorded 100.0 % of 10 problems ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 2.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 4.1399999e+00 0.00e+00 1.00e-06 -1.0 2.07e+00 - 1.00e+00 1.00e+00h 1 2 4.0028284e+00 0.00e+00 2.83e-08 -2.5 6.86e-02 - 1.00e+00 1.00e+00f 1 3 4.0001504e+00 0.00e+00 1.50e-09 -3.8 1.34e-03 - 1.00e+00 1.00e+00f 1 4 4.0000018e+00 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 3.9999999e+00 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: 3.9999999425059038e+00 3.9999999425059038e+00 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 14.289 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.1399999e+00 0.00e+00 1.00e-06 -1.0 1.07e+00 - 1.00e+00 1.00e+00h 1 2 2.0028284e+00 0.00e+00 2.83e-08 -2.5 6.86e-02 - 1.00e+00 1.00e+00f 1 3 2.0001504e+00 0.00e+00 1.50e-09 -3.8 1.34e-03 - 1.00e+00 1.00e+00f 1 4 2.0000018e+00 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 1.9999999e+00 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: 1.9999999425059038e+00 1.9999999425059038e+00 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.4850051e-02 7.42e-03 1.29e-01 -1.7 4.00e-02 - 1.00e+00 7.42e-01h 1 2 2.8283669e-03 0.00e+00 2.83e-08 -2.5 8.84e-03 - 1.00e+00 1.00e+00h 1 3 1.5036416e-04 0.00e+00 1.50e-09 -3.8 1.34e-03 - 1.00e+00 1.00e+00f 1 4 1.7849146e-06 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -5.7494096e-08 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -5.7494095964807319e-08 -5.7494095964807319e-08 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.9800001e+00 0.00e+00 2.50e-01 -1.7 1.98e+00 - 1.00e+00 5.00e-01f 1 2 -1.9800001e+00 0.00e+00 2.00e-07 -1.7 1.30e-09 - 1.00e+00 1.00e+00f 1 3 -1.9998496e+00 0.00e+00 1.50e-09 -3.8 9.92e-03 - 1.00e+00 1.00e+00f 1 4 -1.9999982e+00 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -2.0000001e+00 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -2.0000000574940962e+00 -2.0000000574940962e+00 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -3.9600001e+00 0.00e+00 2.46e-01 -1.0 3.90e+00 - 1.00e+00 5.08e-01f 1 2 -3.9800001e+00 0.00e+00 2.00e-07 -1.7 1.00e-02 - 1.00e+00 1.00e+00f 1 3 -3.9998496e+00 0.00e+00 1.50e-09 -3.8 9.92e-03 - 1.00e+00 1.00e+00f 1 4 -3.9999982e+00 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -4.0000001e+00 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -4.0000000574940957e+00 -4.0000000574940957e+00 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -5.9400001e+00 0.00e+00 2.48e-01 -1.0 5.90e+00 - 1.00e+00 5.03e-01f 1 2 -5.9800000e+00 0.00e+00 2.00e-07 -1.7 2.00e-02 - 1.00e+00 1.00e+00f 1 3 -5.9998496e+00 0.00e+00 1.50e-09 -3.8 9.92e-03 - 1.00e+00 1.00e+00f 1 4 -5.9999982e+00 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -6.0000001e+00 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -6.0000000574940957e+00 -6.0000000574940957e+00 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -7.9200001e+00 0.00e+00 2.49e-01 -1.0 7.90e+00 - 1.00e+00 5.01e-01f 1 2 -7.9800000e+00 0.00e+00 2.00e-07 -1.7 3.00e-02 - 1.00e+00 1.00e+00f 1 3 -7.9998496e+00 0.00e+00 1.50e-09 -3.8 9.92e-03 - 1.00e+00 1.00e+00f 1 4 -7.9999982e+00 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -8.0000001e+00 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -8.0000000574940966e+00 -8.0000000574940966e+00 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -9.9000001e+00 0.00e+00 2.50e-01 -1.0 9.90e+00 - 1.00e+00 5.00e-01f 1 2 -9.9800000e+00 0.00e+00 2.00e-07 -1.7 4.00e-02 - 1.00e+00 1.00e+00f 1 3 -9.9998496e+00 0.00e+00 1.50e-09 -3.8 9.92e-03 - 1.00e+00 1.00e+00f 1 4 -9.9999982e+00 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -1.0000000e+01 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -1.0000000057494097e+01 -1.0000000057494097e+01 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.1880000e+01 0.00e+00 2.50e-01 -1.0 1.19e+01 - 1.00e+00 4.99e-01f 1 2 -1.1980000e+01 0.00e+00 2.00e-07 -1.7 5.00e-02 - 1.00e+00 1.00e+00f 1 3 -1.1999850e+01 0.00e+00 1.50e-09 -3.8 9.92e-03 - 1.00e+00 1.00e+00f 1 4 -1.1999998e+01 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -1.2000000e+01 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -1.2000000057494097e+01 -1.2000000057494097e+01 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 1 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 0.00e+00 5.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.3860000e+01 0.00e+00 2.51e-01 -1.0 1.39e+01 - 1.00e+00 4.99e-01f 1 2 -1.3980000e+01 0.00e+00 2.00e-07 -1.7 6.00e-02 - 1.00e+00 1.00e+00f 1 3 -1.3999850e+01 0.00e+00 1.50e-09 -3.8 9.92e-03 - 1.00e+00 1.00e+00f 1 4 -1.3999998e+01 0.00e+00 1.84e-11 -5.7 7.43e-05 - 1.00e+00 1.00e+00f 1 5 -1.4000000e+01 0.00e+00 2.49e-14 -8.6 9.21e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: -1.4000000057494097e+01 -1.4000000057494097e+01 Dual infeasibility......: 2.4868995751603507e-14 2.4868995751603507e-14 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5059039288067052e-09 2.5059039288067052e-09 Overall NLP error.......: 2.5059039288067052e-09 2.5059039288067052e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 6 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 1 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.003 EXIT: Optimal Solution Found. [ Info: Recorded 100.0 % of 10 problems [ Info: Batch ID: 828420d0-14ca-11f0-3758-29acb3352479 [info | PowerModels]: extending matpower format with data: areas 1x3 [info | PowerModels]: removing 1 cost terms from generator 4: [4000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 1: [1400.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 5: [1000.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 2: [1500.0, 0.0] [info | PowerModels]: removing 1 cost terms from generator 3: [3000.0, 0.0] [info | PowerModels]: updated generator 4 cost function with order 2 to a function of order 3: [0.0, 4000.0, 0.0] [info | PowerModels]: updated generator 1 cost function with order 2 to a function of order 3: [0.0, 1400.0, 0.0] [info | PowerModels]: updated generator 5 cost function with order 2 to a function of order 3: [0.0, 1000.0, 0.0] [info | PowerModels]: updated generator 2 cost function with order 2 to a function of order 3: [0.0, 1500.0, 0.0] [info | PowerModels]: updated generator 3 cost function with order 2 to a function of order 3: [0.0, 3000.0, 0.0] [ Info: Saving CSV file to /tmp/jl_siqC7o/DCPPowerModel/pglib_opf_case5_pjm_DCPPowerModel_input_828420d0-14ca-11f0-3758-29acb3352479.csv - Mode: write [ Info: Recorded 60.0 % of 20 problems [ Info: Training machine(MultitargetNeuralNetworkRegressor(builder = FullyConnectedBuilder(hidden_sizes = [64, 32]), …), …). [ Info: MLJFlux: converting input data to Float32 [ Info: Loss is 1.746e7 [ Info: Loss is 1.746e7 [ Info: Loss is 1.745e7 [ Info: Loss is 1.745e7 [ Info: Loss is 1.745e7 [ Info: Loss is 1.744e7 [ Info: Loss is 1.743e7 [ Info: Loss is 1.742e7 [ Info: Loss is 1.74e7 [ Info: Loss is 1.737e7 [ Info: Loss is 1.734e7 [ Info: Loss is 1.729e7 [ Info: Loss is 1.722e7 [ Info: Loss is 1.714e7 [ Info: Loss is 1.703e7 [ Info: Loss is 1.69e7 [ Info: Loss is 1.675e7 [ Info: Loss is 1.657e7 [ Info: Loss is 1.636e7 [ Info: Loss is 1.613e7 Test Summary: | Pass Total Time LearningToOptimize.jl | 110 110 10m31.8s Testing LearningToOptimize tests passed Testing completed after 1158.73s PkgEval succeeded after 1837.66s