I believe that the answer is currently: no, Sage cannot do integer linear programming. But I could be wrong, if that capability is hiding in something added since the last time this question came up. I am not sure what open source code is out there to do that - ?
M. Hampton On Oct 7, 12:38 pm, Paul Zimmermann <[EMAIL PROTECTED]> wrote: > Hi, > > a question of a colleague from my lab: > > can Sage solve linear systems A*x=b, where A is a matrix with positive > integer coefficients, b is a vector with positive integer coefficients, > and the unknown vector x is searched over the positive integers? > > I guess this is more or less equivalent to integer linear programming (ILP), > seehttp://en.wikipedia.org/wiki/Integer_linear_programming#Integer_unknowns. > > Paul Zimmermann --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
