[Clp] (no subject)

[Daniel Bienstock]

Hello,
  I have a tough LP that the callable version of Clp declares infeasible;
however the command-line version eventually (slowly) solves it but
complaining a bit at the end about remaining infeasibilities.  Commercial
solvers do solve this problem. Question: how can I get the callable version
to also solve the problem to optimality.  Thanks.

-- 
www.columbia.edu/~dano
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/clp/attachments/20090728/f72a9e9f/attachment.html>