XavierG

Thanks @odow for having initiated this discussion, and I am happy to see it. We are developping vOptSolver which is currently composed of two packages, vOptSpecific and vOptGeneric. vOptGeneric is...

In writing ```julia @objective(model, Max, [dot(x, p1), dot(x, p2)]) ``` the user cannot (1) blend functions to minimize and to maximize in the model, and (2) point out a function...

[vOptGeneric](https://github.com/vOptSolver) solves generic linear problems with 2 objectives with e.g. an epsilon constraint method (+ MIP solver available from JuMP). It is compliant with the last versions of julia and...

Before the integration of MOP features into CPLEX and Gurobi, we have integrated in vOptGeneric two methods aiming to solve weighted sum and the lexicographic LP/MIP with any solver interfaced...

We have many 2-objective and several 3-objective instances on our archives. All of them have been used for numerical experiments in our papers and projects since the last 30 years....

Great! Indeed, for each non-dominated point $y' \in Y_N$ we are talking about the set of efficient solutions in term of - the maximum complete set $X_{E_M}$: contains all solutions...

Some remarks: #### 1) To base tests to the minimum set of non-dominated points is a reasonable choice for algorithms aiming to compute $Y_N$. For the Dichotomic algorithm, a similar...

Good suggestion.