On 2012-05-30, Ruslan Kiianchuk <[email protected]> wrote: > ------=_Part_129_12472377.1338370192511 > Content-Type: text/plain; charset=ISO-8859-1 > > Is it possible to solve quadratic inequalities with MILP? Trying to do so I > get an error:
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"? > > sage: p = MixedIntegerLinearProgram(maximization=False, solver='GLPK') > sage: x = p.new_variable(integer=False) > sage: eq = x[5] * x[0] + x[6] * x[1] + x[7] * x[2] + x[8] * x[3] + x[9] * x[ > 4]; eq > x_1 x_0 +x_3 x_2 +x_5 x_4 +x_7 x_6 +x_9 x_8 > > -- 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
