Remove duplicated methods (#69)

Author: odow

src/MultiObjectiveAlgorithms.jl

@@ -610,6 +610,10 @@ function _warn_on_nonfinite_anti_ideal(algorithm, sense, index)
     return
 end
 
+function _project(x::Vector{Float64}, axis::Int)
+    return [x[i] for i in 1:length(x) if i != axis]
+end
+
 for file in readdir(joinpath(@__DIR__, "algorithms"))
     include(joinpath(@__DIR__, "algorithms", file))
 end

src/algorithms/KirlikSayin.jl

@@ -34,6 +34,8 @@ struct _Rectangle
     end
 end
 
+_volume(r::_Rectangle, l::Vector{Float64}) = prod(r.u - l)
+
 function Base.issubset(x::_Rectangle, y::_Rectangle)
     @assert length(x.l) == length(y.l) "Dimension mismatch"
     return all(x.l .>= y.l) && all(x.u .<= y.u)
@@ -72,12 +74,6 @@ function _update_list(L::Vector{_Rectangle}, f::Vector{Float64})
     return L_new
 end
 
-function _project(x::Vector{Float64}, axis::Int)
-    return [x[i] for i in 1:length(x) if i != axis]
-end
-
-_volume(r::_Rectangle, l::Vector{Float64}) = prod(r.u - l)
-
 function optimize_multiobjective!(algorithm::KirlikSayin, model::Optimizer)
     start_time = time()
     sense = MOI.get(model.inner, MOI.ObjectiveSense())

src/algorithms/TambyVanderpooten.jl

@@ -8,14 +8,14 @@
 
 `TambyVanderpooten` implements the algorithm of:
 
-Satya Tamby, Daniel Vanderpooten (2021) Enumeration of the Nondominated Set 
-of Multiobjective Discrete Optimization Problems. INFORMS Journal on 
+Satya Tamby, Daniel Vanderpooten (2021) Enumeration of the Nondominated Set
+of Multiobjective Discrete Optimization Problems. INFORMS Journal on
 Computing 33(1):72-85.
 
 This is an algorithm to generate all nondominated solutions for multi-objective
-discrete optimization problems. The algorithm maintains upper bounds (for 
-minimization problems) and their associated defining points. At each iteration, 
-one of the objectives and an upper bound is picked and the single objective 
+discrete optimization problems. The algorithm maintains upper bounds (for
+minimization problems) and their associated defining points. At each iteration,
+one of the objectives and an upper bound is picked and the single objective
 reformulation is solved using one of the defining points as a starting solution.
 
 ## Supported optimizer attributes
@@ -25,12 +25,6 @@ reformulation is solved using one of the defining points as a starting solution.
 """
 mutable struct TambyVanderpooten <: AbstractAlgorithm end
 
-function _project(x::Vector{Float64}, axis::Int)
-    return [x[i] for i in 1:length(x) if i != axis]
-end
-
-_volume(r::_Rectangle, l::Vector{Float64}) = prod(r.u - l)
-
 function _update_search_region(
     U_N::Dict{Vector{Float64},Vector{Vector{Vector{Float64}}}},
     y::Vector{Float64},