Hi,
I'm very new to minizinc. I'm trying to solve a basic routing problem in which the objective function has quadratic terms.
Basically the objective function is as follows.
minimize : (D - R)^2 + (S - O)^2
Here, D and S, are float type decision variables and R and O are input values.
However, I can not run this with all the bundled solvers (COIN_OR CBC, G12 MIP, etc.) except for Gecode (Gecode takes a very long time and did not find the optimal).
All these solvers take issues with quadratic multiplication of float type variables and show errors such as : Error: constraint not found: float_times (CBC solver gives this error).
But I found that CBC supports quadratic terms according to its user guide. Attached is a screenshot taken from the user guide.
Has anyone experienced a similar problem? I would be very grateful if anyone can help me with this?
How can I solve miqp problems in minizinc? Any preferred solvers for these type of problems?
