#14540: MILP constraints do no deal with Python ints properly
--------------------------------------+------------------------
Reporter: ncohen | Owner: ncohen
Type: defect | Status: new
Priority: major | Milestone: sage-7.2
Component: linear programming | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------------+------------------------
Changes (by jdemeyer):
* milestone: sage-6.4 => sage-7.2
Old description:
> {{{
> sage: p = MixedIntegerLinearProgram()
> sage: b = p.new_variable()
> sage: p.add_constraint(int(1) <= b[0] + b[1] + b[2] <= int(2))
> sage: p.show()
> Maximization:
>
> Constraints:
> x_0 + x_1 + x_2 <= 2.0
> Variables:
> x_0 is a continuous variable (min=0.0, max=+oo)
> x_1 is a continuous variable (min=0.0, max=+oo)
> x_2 is a continuous variable (min=0.0, max=+oo)
> }}}
>
> The code above works on the command-line. In a script, you can do without
> the `int()`.
>
> Nathann
New description:
{{{
sage: p = MixedIntegerLinearProgram()
sage: b = p.new_variable()
sage: p.add_constraint(int(1) <= b[0] + b[1] + b[2] <= int(2))
sage: p.show()
Maximization:
Constraints:
x_0 + x_1 + x_2 <= 2.0
Variables:
x_0 is a continuous variable (min=0.0, max=+oo)
x_1 is a continuous variable (min=0.0, max=+oo)
x_2 is a continuous variable (min=0.0, max=+oo)
}}}
The code above works on the command-line. In a script, you can do without
the `int()`.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/14540#comment:8>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
