Dear John,
On Oct 8, 10:01 pm, John H Palmieri [EMAIL PROTECTED] wrote:
...
This may be a silly question, but integer linear programming seems to
be about maximizing some quantity relative to constraints given by a
matrix equality (or inequality), where everything is happening over
the
On Wednesday 08 October 2008, Marshall Hampton wrote:
Martin - is that already accessible in sage or would some sort of
wrapper have to be written?
Here are the Singular examples done with Sage:
sage: singular.LIB(intprog.lib)
1. call with single right-hand vector
sage: A = matrix(ZZ, 2, 3,
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,
On Oct 7, 8:38 pm, Paul Zimmermann [EMAIL PROTECTED] wrote:
a question of a colleague from my lab:
... integer linear programming (ILP)
I'm not sure either, but he could try his luck with openopt:
http://scipy.org/scipy/scikits/wiki/MILP interfacing with lpsolve or
glpk.
h
On Tuesday 07 October 2008, Paul Zimmermann 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
I have created a spkg to install lp_solve into Sage; it can be obtained at:
http://www.math.unl.edu/~shartke2/files/lp_solve-5.5.0.13.spkg
I have posted to sage-devel suggesting this spkg for inclusion into Sage.
lp_solve includes a linear programming solver (simplex based) and an integer
Martin - is that already accessible in sage or would some sort of
wrapper have to be written?
Is this what you are looking for:
http://www.singular.uni-kl.de/Manual/3-0-4/sing_610.htm
?
Cheers,
Martin
--
name: Martin Albrecht
