Originally posted by: EdKlotz
>
> Hello,
>
> I am working with cplex and c++ together.
>
> I built a MIP(about 70 binary variables), and I used several logical constraints.
>
> The problem is that the program works well with some datasets. But for some particular ones, it's infeasible.
>
> I tried to solve the problem by looking at the linear program I exported, but no result.
>
> I tried to use conflict refiner, but it didn't give me any suggestion.
What exactly do you mean when you say the conflict refiner didn't give you any suggestion?
Do you mean that CPLEX claimed the model was infeasible when you optimized, but the
conflict refiner said it was feasible? Or did the conflict refiner give you a conflict,
but the size of the conflict was too large to enable straightforward assessment of the
cause of the infeasibility?
Can you reproduce the infeasibility by reading in the exported linear program into
interactive CPLEX? If so, please post the output when you try to run the conflict
refiner afterwards.
>
> Any one know the possible reasons for this weird problem?
>
> Thanks in advance.
#CPLEXOptimizers#DecisionOptimization