Originally posted by: amindehghanian

Hi,

I need to see if a given solution x satisfies a given integer program. Is there any quick way to do it other than using "CPXgetrowinfeas"?

Thanks,

Amin

Fix all the variables (by setting upper bound = lower bound = value), call the conflict refiner, and see if it finds a conflict.

Paul

Originally posted by: TobiasAchterberg

Or just solve it with regular CPXmipopt. But I do not see why this should be easier than CPXgetrowinfeas. What is the reason why you do not want to use CPXgetrowinfeas? This sounds pretty easy to me...

Tobias