Python package for implementing branch-and-bound technique for solving a non-convex non-linear integer multi-objective optimization problem?

Asked Oct 05 '21 at 03:01

Active Oct 07 '21 at 16:59

Viewed 367 times

Here, X1 and X2 take integer values. I want to use branch-and-bound technique to solve this problem. What are the python tools available to solve this problem?

edited Oct 07 '21 at 00:59

asked Oct 05 '21 at 03:01

vp_050

This question may be useful to you: https://scicomp.stackexchange.com/questions/19870/python-solvers-for-mixed-integer-nonlinear-constrained-optimization – Nick ODell Oct 07 '21 at 18:16
pyomo + couenne. – sascha Oct 10 '21 at 23:35

Python package for implementing branch-and-bound technique for solving a non-convex non-linear integer multi-objective optimization problem?

0 Answers0