Update

Author: odow

src/algorithms/KirlikSayin.jl

@@ -169,7 +169,9 @@ function minimize_multiobjective!(algorithm::KirlikSayin, model::Optimizer)
         end
         X, Y = _compute_point(model, variables, model.f)
         Y_proj = _project(Y, k)
-        if !(Y in YN)
+        # We want `if !(Y in YN)` but this tests exact equality. We want
+        # an approximate comparison.
+        if all(!isapprox(Y; atol = 1e-6), YN)
             push!(solutions, SolutionPoint(X, Y))
             push!(YN, Y)
             L = _update_list(L, Y_proj)

src/algorithms/TambyVanderpooten.jl

@@ -180,7 +180,9 @@ function minimize_multiobjective!(
         MOI.delete.(model, ε_constraints)
         MOI.delete(model, y_k_constraint)
         push!(V[k], (u, Y))
-        if Y ∉ U_N[u][k]
+        # We want `if !(Y in U_N[u][k])` but this tests exact equality. We want
+        # an approximate comparison.
+        if all(!isapprox(Y; atol = 1e-6), U_N[u][k])
             _update_search_region(U_N, Y, yN)
             solutions[Y] = X
         end
@@ -205,6 +207,5 @@ function minimize_multiobjective!(
             end
         end
     end
-    solutions_vec = [SolutionPoint(X, Y) for (Y, X) in solutions]
-    return status, filter_nondominated(MOI.MIN_SENSE, solutions_vec)
+    return status, [SolutionPoint(X, Y) for (Y, X) in solutions]
 end