Not sure if this is the correct place to post this question.
From my experience, Gurobi solves MIQCPs significantly faster than other general global optimization solvers. However, I am wondering, can Gurobi now or potentially in future, solve general MINLP models including nonconvexities such as log, exp, sin, higher order polynomials? If there is an undergoing project to develop such feature, when can we expect this coming to reality?
Please sign in to leave a comment.