Re: [Help-glpk] glpsol (MIP) "-w" output specification, "-y" operation

[Michael Hennebry]

On Fri, 8 May 2009, Johannes Waldmann wrote:

> > > Z = SUM Bz[j, k]*max(j, k)
> > >    j,k
>
> yes, that's basically a unary encoding of numbers as bit strings.
> If I'm taking that route, I can go all the way and use *only* booleans.
> Then it's a SAT problem, and there are very good solvers for these,
> see http://www.satcompetition.org/

I wasn't really suggesting unary, just noting the possibility.
I'm intermittently working on the SAT solver that I
didn't get done in time for this year's competition.

> I'll give MIP one more try, though,
> reducing the "big M" as far as possible.

Absent more information, the big M sizes I gave are as small as they will go.

--
Michael   address@hidden
"Pessimist: The glass is half empty.
Optimist:   The glass is half full.
Engineer:   The glass is twice as big as it needs to be."