New answers tagged


Julia Niebling and Gabriele Eichfelder recently published a paper on solving nonconvex multiobjective optimization problems using branch and bound. You can find the paper through the following link


Yes we can. Branch and bound can both deal the integer variables and with the potenial non convexities of the non-linear functions. Most branch and bound methods can also handle constraints. Depending on the solver you might need provide an relaxation for the bounding part. However multi objective branch and bound methods are harder to come by, i am still ...

Top 50 recent answers are included