That was a quick answer, thanks. I am programming Haskell, not C, so going via the API is some work (but perfectly possible).
As a workaround, I was including "display" statements and parsing their output. Because I wanted to make some experiments first, and it seems glpsol does not like the kind of MIP instances my application generates: I really want to encode constraints of the form z = max(x,y). (for min, likewise). I know this is not LP. There is an encoding using an additional boolean variable for each max, but I have a few hundred of these, and that's apparently too hard for the solver. (I also checked with zimpl/scip/soplex and it's similar.) Best regards, J.W.
signature.asc
Description: OpenPGP digital signature
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
