On Thursday, 31 May 2012 23:45:36 UTC+2, Ruslan Kiyanchuk wrote: > > You can try SCIP which is a constraint integer programming solver and >> supports >> quadratic constraints. I started a Sage interface here: > > > Thank you, will try it. Couldn't figure out if the interface to Sage > actually exists. > > I guess you need to explain what do you mean by "solving". >> The solution set is in general infinite. >> Do you mean "checking for existence of solutions"? >> Or perhaps "finding a representative of each connected component"? >> Or "finiding a parametric representation of the solutions"? > > > The solution set isn't infinite if integers are considered. >
that's only if you impose some bound on the sizes of integers you want. > I know the code sample says integer=False, but I've just tried to get rid > of the error :) Checking for existence of solutions might help as well > since solving the inequalities is used for generating codes with good > correlation properties. But getting the exact variables values satisfying > the inequalities is the primary goal. > > -- > Sincerely, Ruslan Kiyanchuk > -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
