Forum Discussion
General nonlinear mixed integer problems
Hello, I'm trying to solve a nonlinear mixed integer problem (quadratic objective function, quadratic constrains, non convex, mixed integer) using mmxnlp, but I'm getting a feasible solution that is...
Hi there,
if the problem is nonlinear nonconvex it is not possible to solve it to global optimality unless you have a global solver. With nonconvex objective function and/or nonconvex constraints, Xpress uses SLP, a nonlinear solver that returns a local optimum, but not necessarily a global optimum. It is therefore possible, as you report, to have solutions that are better than that found by SLP.
Hope this helps. Regards,
Pietro
Related Content
Related Content
Final solution of a nonlinear non-convex problem solved with Knitro (via Xpress) looks worse than the initial solution
Dear all, I have a couple of questions on the use of the procedure setinitval and more in general on the use of an initial solution for solving a nonlinear problem. I am solving a series of nonline...