Couldn't you use SCIP for this? http://scip.zib.de/ http://trac.sagemath.org/sage_trac/ticket/10879
On Friday 13 Apr 2012, Nathann Cohen wrote: > Hello everybody !!! > > I would like to solve a set of equations with a very easy shape. My > equations are defined on variables p1_x, p1_y, p2_x, p2_y, ..., and I > > would like to obtain values for them satisfying constraints like : > |p1 - p2| < 1, i.e. (p1_x - p2_x)^2 + (p1_y - p2_y)^2 < 1 > > or something similar with a > instead of <. I do not really mind > whether the inequalities are strict or not, as I feel free to replace > < 1 by <= 0.9. > > Would you know of any way to solve this type of equations, or to > ensure that no solution exists ? > > Thank youuuuuuuu ! :-) > > Nathann Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://martinralbrecht.wordpress.com/ _jab: [email protected] -- 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
