On 2013-01-31, Daniel Friedan wrote:
> --=_Part_880_30796308.1359641848689
> Content-Type: text/plain; charset=ISO-8859-1
>
> First, I'll try my MILP problems in double-precision (probably using
> CPLEX). I'll re-post my question about arbitrary precision if it turns out
> that I need it.
I
First, I'll try my MILP problems in double-precision (probably using
CPLEX). I'll re-post my question about arbitrary precision if it turns out
that I need it.
We definitely needed arbitrary precision when we did some related problems
using semi-definite programming (over the real numbers -- w
On 2013-01-29, dfrie...@gmail.com wrote:
> Dmitrii,
>
> Thanks very much. Sorry for the dumb posting. I should have mentioned
> in my posting that I'm just getting into MILP in Sage.
>
> Would it be equally dumb to post a question asking if there is an
> arbitrary precision real arithmetic sol
Dmitrii,
Thanks very much. Sorry for the dumb posting. I should have mentioned
in my posting that I'm just getting into MILP in Sage.
Would it be equally dumb to post a question asking if there is an
arbitrary precision real arithmetic solver for MILP in Sage? (maybe a
version of GLPK?)
Thanks. Sorry for the dumb posting.
Daniel
On Tuesday, January 29, 2013 3:37:43 PM UTC, Dima Pasechnik wrote:
>
> On 2013-01-29, Daniel Friedan > wrote:
> > --=_Part_964_12292304.1359472365223
> > Content-Type: text/plain; charset=ISO-8859-1
> >
> > The following example from Sage Refere
On 2013-01-29, Daniel Friedan wrote:
> --=_Part_964_12292304.1359472365223
> Content-Type: text/plain; charset=ISO-8859-1
>
> The following example from Sage Reference v5.6 >> Numerical Optimization >>
> Mixed integer linear programming
> http://www.sagemath.org/doc/reference/sage/numer
