mateu / algorithm-simplex Goto Github PK

Hi @mateu,

Thank you for creating this module. I've tried looking for an implementation of the simplex method that works with arbitrary precision rationals rather than just being a thin wrapper around gplk (which I believe only supports floating point). I think it would be convenient if there were an alternate constructor that allowed users to get the initial starting Tucker tableau given A, b, and c (possibly replacing maximize with minimize, depending on what's easiest). I'll submit a pull request a bit later if you are open to the idea.

Thanks,
Greg

edit: Actually ... given how the Tucker tableau is constructed this would actually be a pretty trivial thing for an end user to construct themselves, it might be a better idea to include an example in the synopsis showing how to construct a Tucker tableau from a linear program in standard form (Ax <= b, minimize c'x). One non-cosmetic change I could potentially see being interesting is adding support for equality constraints. Given an equality constraint w'x = c, you can represent it as w'x <= c and -w'x <= -c, but I recall there being a more efficient way to express this while manipulating Tucker tableau.