Forum Discussion
Is it possible to output wether or not Branch and Bound was used during optimization?
On my current MIP model I'm checking the value of the ALGORITHM attribute to see which algorithm is used. This works fine for smaller parameters, but via setparam("XPRS_verbose", true) I noticed that...
I'm not sure I understand your question correctly. What kind of problems are you trying to solve?
If the problem is a MIP or an MINLP (or a nonconvex NLP), then branch and bound will be used to solve it, regardless of problem size. For a linear or convex quadratic problem the algorithm is never B&B.
Is it possible that you generate a nonconvex quadratic problem for larger parameters?
