[Bonmin] isProvenDualInfeasible error message

[Francois Dionne]

Dear mailing list,

I have followed your advice and placed code inside my C++ sources to set the algorithm to B-BB for my non-convex problem.

Now I have a different problem: when I execute my binary, this is the result:

******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
 Ipopt is released as open source code under the Common Public License (CPL).
         For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************

IpOp0008I 
                   Num    Status         Obj                It         time
IpOp0009I     1        INFEAS      -3                   990      1.14807
IpOp0010I     r1       INFEAS      -0.0947173      195      0.212013
IpOp0010I     r2       INFEAS      -0.0500028      203      0.224014
IpOp0010I     r3       INFEAS      -0.05               371      0.420026
IpOp0010I     r4       INFEAS      -0.0500004      263      0.284018
IpOp0010I     r5       INFEAS      -0.0500002      223      0.244015
IpOp0010I     r6       INFEAS      -0.0500375      271      0.30802
IpOp0010I     r7       INFEAS      -3                   850      1.04407
IpOp0010I     r8       INFEAS      -0.05              1478     1.81611
IpOp0010I     r9       INFEAS      -3                   263      0.292018
IpOp0010I     r10      INFEAS      -0.0500003     523      0.624039
Cbc0006I The LP relaxation is infeasible or too expensive
IpoptInterface::isProvenDualInfeasible
Don't have this optimization status yet.


Did I do a mistake?  Does this mean my code accidently called an unsupported function of Ipopt? What should I do?

Thank you for your previous help, and have a nice day.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/bonmin/attachments/20080610/b57d2e31/attachment.html