[Bonmin-tickets] [Bonmin] #51: Incorrect mipStatus for infeasible continuous problem

[Bonmin]

#51: Incorrect mipStatus for infeasible continuous problem
----------------------+----------------------
Reporter:  jonnyz007  |       Owner:  pbonami
    Type:  defect     |      Status:  closed
Priority:  trivial    |   Component:  Bonmin
 Version:  1.5        |  Resolution:  fixed
Keywords:             |
----------------------+----------------------

Comment (by jonnyz007):

 Hi Stefan,

 You are correct the code has made it across, but a problem still exists.
 Bonmin is returning "FeasibleOptimal" when it fails solving an infeasible
 continuous problem with a failed initial point.

 Try solving the problem min -x with 0 <= x <= Inf and x0 = 0 (no integer
 vars). I get:

 Cbc3007W No integer variables - nothing to do

 NLP0010I Ipopt return (for initialSolve): status -8, iter count   15, time
 0.008
 NLP0012I
               Num      Status      Obj             It       time
 Location

 NLP0014I             1      FAILED -1.2580052e+018       15 0.008

 NLP0010I Ipopt return (for initialSolve): status -8, iter count   15, time
 0.007

 NLP0014I             2      FAILED -1.2580052e+018       15 0.007

 Cbc3007W No integer variables - nothing to do

 Cbc0006I The LP relaxation is infeasible or too expensive


 But still returns FeasibleOptimal...

 Jonathan

 Replying to [comment:3 stefan]:
 > As far as I see, the change made it.
 > I believe you refer to r2014 and I can see exactly this code in
 Bonmin/1.7:
 > https://projects.coin-
 or.org/Bonmin/browser/stable/1.7/Bonmin/src/CbcBonmin/BonCbc.cpp#L600

-- 
Ticket URL: <https://projects.coin-or.org/ticket/51#comment:4>
Bonmin <http://projects.coin-or.org/Bonmin>
Basic Open-source Nonlinear Mixed INteger programming