@@ -20,8 +20,7 @@ function MOA.minimize_multiobjective!(
2020)
2121 # Some constants. These could be converted into algorithm options.
2222 # - atol: the absolute tolerance used to compare solutions in objective space
23- # - wnorm: ???
24- atol, wnorm = 1e-6 , 1e2
23+ atol = 1e-6
2524 # Storage we need for the algorithm.
2625 weights, solutions = Weight[], MOA. SolutionPoint[]
2726 n_obj = MOI. output_dimension (model. f)
@@ -34,11 +33,11 @@ function MOA.minimize_multiobjective!(
3433 end
3534 push! (solutions, solution)
3635 # Initialize the weights. There is one weight vector for each objective, and
37- # the weight is set to wnorm for each objective. We use the current solution
36+ # the weight is set to 1.0 for each objective. We use the current solution
3837 # obtained by minimizing the 1st objective as the reference.
3938 for i in 1 : n_obj
4039 w = zeros (Float64, n_obj)
41- w[i] = wnorm
40+ w[i] = 1.0
4241 z = w' * solution. y
4342 adj_bnd = Int[- j for j in 1 : n_obj if j != i]
4443 push! (weights, Weight (w, z, adj_bnd, [1 ], i == 1 , false ))
@@ -99,7 +98,7 @@ function MOA.minimize_multiobjective!(
9998 end
10099 end
101100 # Construction of the weight polytope for the new solution.
102- h = Polyhedra. HyperPlane (ones (n_obj), wnorm )
101+ h = Polyhedra. HyperPlane (ones (n_obj), 1.0 )
103102 for i in 1 : n_obj
104103 vec = zeros (Float64, n_obj)
105104 vec[i] = - 1.0
0 commit comments