Originally posted by: JorisK
Dear,
Using the Java programming interface of CPLEX, I've built a rather complicated MIP model. The model is initialized with a feasible initial solution by invoking the addMIPStart(vars, values, IloCplex.MIPStartEffort.CheckFeas); function. However, when solving the MIP problem, I get the following error:
Warning: No solution found from 1 MIP starts.
which implies that either my initial solution is not feasible, or my model cuts of feasible solutions. In either case I would like to find the constraints which cut of the initial solution. According to the documentation (User's Manual for CPLEX > Refining a conflict in a MIP start) there are multiple approaches to find a minimal conflict set of constraints. I first exported the MIP model to a file using the cplex.exportModel("test.lp"); function. Additionally, I exported the MIP start via the function cplex.writeMIPStart("mipStart.mst"); (see attached documents).
Finally, I tried to determine the conflict using the Interactive Optimizer as suggested in this thread:
http://www.ibm.com/developerworks/forums/thread.jspa?threadID=363875 CPLEX> read test.lp
Problem 'test.lp' read.
Read time = 0.03 sec.
CPLEX> read mipStart.mst
MIP start file 'mipStart.mst' read.
CPLEX> conflict 1
Refine conflict on 3000 members...
Iteration Max Members Min Members
1 0 0
Minimal conflict: 0 linear constraint(s)
0 lower bound(s)
0 upper bound(s)
Conflict computation time = 0.02 sec. Iterations = 1
Apparently the approach suggested in the previous thread does not work (anymore) as I do not get any conflicts, or am I doing something wrong?
#CPLEXOptimizers#DecisionOptimization