The routine CPXrefineconflict identifies a minimal conflict for the infeasibility of the linear constraints and the variable bounds in the current model. Since the conflict returned by this routine is minimal, removal of any member constraint or variable bound will remove that particular source of infeasibility. Note that there may be other conflicts in the model, so that repair of a conflict does not guarantee feasibility of the remaining model.

To find a conflict by considering the quadratic constraints, indicator constraints, or special ordered sets, as well as the linear constraints and variable bounds, use CPXrefineconflictext.

When this routine returns, the value in confnumrows_p indicates the number of constraints participating in the conflict, and the value in confnumcols_p indicates the number of variables participating in the conflict. Use the routine CPXgetconflict to determine which constraints and variables participate in the conflict.