I am going to start with GUROBI optimization and I am a beginner in optimization as well. I am looking for any Constraint programming model that can give me a convex hull for a given list of 2D points ?
The list of points [xi, yi] are decision variables and I want the algorithm to be in a purely Constraint programming format, not in Linear programming as I am dealing with only integers. I cannot use floating point values even for obtaining the convex hull.
Is this even possible in a Constraint program? Any materials you could advice me to read? Any posts related to that?
I am considering moving to GUROBI from another operations research library because GUROBI provides a lot of additional functions and the support I staff is very helpful it seems
thanks in advance :)
Please sign in to leave a comment.