On 2016-05-18 13:44, Dima Pasechnik wrote:
Do you mean that you want a cleaner interface for p.polyhedron() in the case when p has more than 1 variable?
Yes. Example:
sage: P = MixedIntegerLinearProgram(solver="PPL") sage: x = P.new_variable(nonnegative=True) sage: y = P.new_variable(nonnegative=True) sage: P.add_constraint(x[3] + y[1] <= 1) sage: P.add_constraint(x[0] + x[1] + x[2] + x[3] <= y[1] - y[0]) sage: P.polyhedron().integral_points() ((0, 0, 0, 0, 0, 0), (0, 1, 0, 0, 0, 0), (0, 1, 0, 0, 0, 1), (0, 1, 0, 0, 1, 0), (0, 1, 0, 1, 0, 0), (0, 1, 1, 0, 0, 0)) Question: how to map the above list of points to the variables of the MILP? -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
