Oscar Dowson

It's not really a fix, but a work-around is ```Julia julia> using JuMP julia> model = Model(); julia> @variable(model, x[1:2]); julia> @objective(model, Min, x[1]^2 + x[2]^3) (x[1]²) + (x[2] ^...

I've opened a PR here: https://github.com/jump-dev/MathOptInterface.jl/pull/2799 It's not guaranteed that I'll merge it, but I'll see if there are any other downstream impacts.

This should be fixed in the next release of MOI

I can reproduce this: ```c #include "interfaces/highs_c_api.h" #include #include int main(int argc, char *argv[]) { void* highs = Highs_create(); assert(Highs_addCol(highs, 1.0, -2.0, 2.0, 0, NULL, NULL) == 0); assert(Highs_addCol(highs, 0.0,...

We already use a mix of hyper refs: https://github.com/JuliaDocs/Documenter.jl/blob/998d26e568a20e3b1764d0c2cef30ebe4d2563ae/src/Writers/LaTeXWriter.jl#L317 https://github.com/JuliaDocs/Documenter.jl/blob/998d26e568a20e3b1764d0c2cef30ebe4d2563ae/src/Writers/LaTeXWriter.jl#L356 But yeah, some way of labeling and ref-ing to tables and figures would be useful.

I started looking into this in #115 One thing I came across is that there might be multiple points in X space for the same Y: https://github.com/vOptSolver/vOptLib/blob/16ecd822af03c3590db44026a4e4160c31d2a996/UKP/X/2KP100-50.max#L24-L25

Personally, I care only about the minimum complete set. We don't benchmark LP solvers against their ability to find multiple solutions. I've added the UKP to: https://github.com/jump-dev/MultiObjectiveAlgorithms.jl/tree/master/instances ## Model The...

> For the Dichotomic algorithm, a similar question arises (to consider only extreme non-dominated points knowing that non extreme non-dominated points may exist and may be obtained by the algorithm)....

Yeah since we currently require 2 objectives, we could add a new parameter for controlling `p` that defaults to `0.0`?

Is this really needed? Our current method finds the extra points, then filters them out. I can see that it might be more efficient if you had lots of non-dominated...