I am trying to solve the following model with osiclp;<br><br> Objective in sparse format:<br> [ 1 , -1] [ 2 , 0] <br> Constraints in sparse format:<br> row 1: 1 <= [ 1 , 0] [ 2 , 0] <= 1<br>
Simple bounds (lower, upper):<br> var 1: ( -10 , 10)<br> var 2: ( -10 , 10)<br><br>When I call si->initialSolve(); it prints out:<br><br>Clp0024I Matrix will be packed to eliminate 2 small elements<br>
Coin0507I Presolve determined that the problem was infeasible with tolerance of 1e-08<br>Clp3003W Analysis indicates model infeasible or unbounded<br>Clp0000I Optimal - objective value -10<br>Clp0032I Optimal objective -10 - 0 iterations time 0.002<br>
<br>And si->isProvenOptimal() returns true.<br><br>Presolve determines the problem is infeasible but Clp says it is optimal.<br><br>Mustafa<br>