Update

Author: odow

src/MultiObjectiveAlgorithms.jl

@@ -7,6 +7,7 @@ module MultiObjectiveAlgorithms
 
 import Combinatorics
 import MathOptInterface as MOI
+import Printf
 
 """
     struct SolutionPoint
@@ -648,8 +649,6 @@ function MOI.delete(model::Optimizer, ci::MOI.ConstraintIndex)
     return
 end
 
-import Printf
-
 """
     optimize_inner!(model::Optimizer)
 
@@ -689,7 +688,7 @@ Log the solution. We have a pre-computed point.
 """
 function _log_solution(model::Optimizer, Y)
     if !model.silent
-        print(_format(model.subproblem_count))
+        print(_format(model.subproblem_count), "  ")
         for y in Y
             print(" ", _format(y))
         end
@@ -704,8 +703,8 @@ Log the solution. Assume the subproblem failed to solve.
 """
 function _log_solution(model::Optimizer, msg::String)
     if !model.silent
-        print(_format(model.subproblem_count), "   ")
-        print(rpad(msg, 13 * MOI.output_dimension(model.f) - 3))
+        print(_format(model.subproblem_count), "  ")
+        print(rpad(msg, 13 * MOI.output_dimension(model.f)))
         println(" ", _format(time() - model.start_time))
     end
     return
@@ -834,11 +833,18 @@ function _optimize!(model::Optimizer)
         return
     end
     if !model.silent
-        print("Iter.")
+        rule = "-"^(7 + 13 * (MOI.output_dimension(model.f) + 1))
+        println(rule)
+        println("        MultiObjectiveAlgorithms.jl")
+        println(rule)
+        println("Algorithm: ", _describe(model.algorithm))
+        println(rule)
+        print("solve #")
         for i in 1:MOI.output_dimension(model.f)
             print(lpad("Obj. $i  ", 13))
         end
         println("     Time    ")
+        println(rule)
     end
     # We need to clear the ideal point prior to starting the solve. Algorithms
     # may update this during the solve, otherwise we will update it at the end.
@@ -851,7 +857,10 @@ function _optimize!(model::Optimizer)
         _sort!(model.solutions, MOI.get(model, MOI.ObjectiveSense()))
     end
     if !model.silent
-        println("Found $(length(model.solutions)) solutions")
+        println(rule)
+        println("Terminating with status: ", status)
+        println("Number of non-dominated solutions: ", length(model.solutions))
+        println(rule)
     end
     if MOI.get(model, ComputeIdealPoint())
         _compute_ideal_point(model)

src/algorithms/Chalmet.jl

@@ -25,6 +25,8 @@ This algorithm is restricted to problems with:
 """
 struct Chalmet <: AbstractAlgorithm end
 
+_describe(::Chalmet) = "Chalmet()"
+
 function _solve_constrained_model(
     model::Optimizer,
     ::Chalmet,

src/algorithms/Dichotomy.jl

@@ -30,6 +30,8 @@ mutable struct Dichotomy <: AbstractAlgorithm
     Dichotomy() = new(nothing)
 end
 
+_describe(::Dichotomy) = "Dichotomy()"
+
 """
     NISE()
 

src/algorithms/DominguezRios.jl

@@ -26,6 +26,8 @@ This algorithm is restricted to problems with:
 """
 struct DominguezRios <: AbstractAlgorithm end
 
+_describe(::DominguezRios) = "DominguezRios()"
+
 mutable struct _DominguezRiosBox
     l::Vector{Float64}
     u::Vector{Float64}

src/algorithms/EpsilonConstraint.jl

@@ -36,6 +36,8 @@ mutable struct EpsilonConstraint <: AbstractAlgorithm
     EpsilonConstraint() = new(nothing, nothing)
 end
 
+_describe(::EpsilonConstraint) = "EpsilonConstraint()"
+
 MOI.supports(::EpsilonConstraint, ::SolutionLimit) = true
 
 function MOI.set(alg::EpsilonConstraint, ::SolutionLimit, value)

src/algorithms/Hierarchical.jl

@@ -37,6 +37,8 @@ mutable struct Hierarchical <: AbstractAlgorithm
     Hierarchical() = new(Int[], Float64[], Float64[])
 end
 
+_describe(::Hierarchical) = "Hierarchical()"
+
 MOI.supports(::Hierarchical, ::ObjectivePriority) = true
 
 function MOI.get(alg::Hierarchical, attr::ObjectivePriority)

src/algorithms/KirlikSayin.jl

@@ -31,6 +31,8 @@ This algorithm is restricted to problems with:
 """
 struct KirlikSayin <: AbstractAlgorithm end
 
+_describe(::KirlikSayin) = "KirlikSayin()"
+
 struct _Rectangle
     l::Vector{Float64}
     u::Vector{Float64}

src/algorithms/Lexicographic.jl

@@ -43,6 +43,8 @@ mutable struct Lexicographic <: AbstractAlgorithm
     end
 end
 
+_describe(::Lexicographic) = "Lexicographic()"
+
 MOI.supports(::Lexicographic, ::ObjectiveRelativeTolerance) = true
 
 function MOI.get(alg::Lexicographic, attr::ObjectiveRelativeTolerance)
@@ -102,8 +104,7 @@ function optimize_multiobjective!(algorithm::Lexicographic, model::Optimizer)
     solutions = SolutionPoint[]
     status = MOI.OPTIMAL
     for sequence in Combinatorics.permutations(sequence)
-        status, solution =
-            _solve_in_sequence(algorithm, model, sequence)
+        status, solution = _solve_in_sequence(algorithm, model, sequence)
         if !isempty(solution)
             push!(solutions, solution[1])
         end

src/algorithms/RandomWeighting.jl

@@ -27,6 +27,8 @@ mutable struct RandomWeighting <: AbstractAlgorithm
     RandomWeighting() = new(nothing)
 end
 
+_describe(::RandomWeighting) = "RandomWeighting()"
+
 MOI.supports(::RandomWeighting, ::SolutionLimit) = true
 
 function MOI.set(alg::RandomWeighting, ::SolutionLimit, value)

src/algorithms/Sandwiching.jl

@@ -28,3 +28,5 @@ algorithm = MOA.Sandwiching(0.0)
 mutable struct Sandwiching <: AbstractAlgorithm
     precision::Float64
 end
+
+_describe(alg::Sandwiching) = "Sandwiching($(alg.precision))"