Hi Nathann!
On Sat, Sep 12, 2009 at 08:27:44PM +0200, Nathann Cohen wrote:
> Linear Programming needs a way to merge programs, to obtain duals without
> more than a call to a .dual() method, and a big database of Linear
> Programs from where other ones can be easily defined.
>
> I do not know much of what can be done in GLPK, Ampl, Cplex, Coin-Or, and
> a lot of other LP-related softwares I have no clues about, which you may
> perfectly know.... Is it something you have already seen somewhere, in
> which case I could try to give it a look to spare some time, or is it new
> and does it need to be built from scratch ?
>
> More importantely, do you think it is -- useful -- ?
This sounds good to me!
A slight variant would be to have the object model a polytope (or
possibly integer points thereof in case of MIP) rather than a linear
program. And then the operations on equations (putting them together,
...) become operations on polytopes, like intersection, cartesian
product, ...
This could possibly help give more conceptual names to the operations,
and/or bridge the link with other software for manipulating polytopes.
Best,
Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
