ILOG CPLEX 11.0 User's Manual

Then you will see results like these:Refine conflict on 14 members...Iteration Max Members Min Members1 11 02 9 03 7 04 2 05 2 16 2 2Minimal conflict: 2 linear constraint(s)0 lower bound(s)0 upper bound(s)Conflict computation time = 0.00 sec. Iterations = 6The first line of output mentions 14 members; this total represents constraints, lower bounds,and upper bounds that may be part of the conflict. There are ten constraints in this model;there are two continuous variables with lower and upper bounds that represent the other fourmembers to be considered. Because binary variables are not reasonable candidates for boundanalysis, the Interactive Optimizer treats the bounds of only the variables cost andservice as potential members of the conflict. If you want all bounds to be candidates, youcould instead declare the binary variables to be general integer variables with bounds of[0,1]. (Making that change in this model would likely result in the conflict refiner suggestingthat one of the binary variables should take a negative value.) On some models, allowing somuch latitude in the bounds may cause the conflict refiner to take far longer to arrive at aminimal conflict.Displaying a Conflict in the Interactive OptimizerAs you can see in the log displayed on the screen, the conflict refiner works to narrow thechoices until it arrives at a conflict containing only two members. Since the conflict is smallin this simplified example, you can see it in its entirety by entering this command:display conflict allMinimizeobj:Subject Toc2: x1 + x2 + 0.8 x3 + 0.6 x4 + 0.4 x5 >= 2.1c8: x2 + x3 + x4 + x5