I am dealing with a large problem of MILP problem and interested to apply Benders Decomposition. I have already check the original problem and it was feasible to run in large number of computation time. I understand in some sources: stackexchangelink and ProfRubinblog that somewhat a careful implementation should be done. I found that after several iterations of unbounded dual sub problem, my master problem had become infeasible. Due to the fact that the original problem is feasible, I suppose that I have to identify cut to add in my master problem.
My question is: When I can't calculate the original problem using traditional method (and that's the reason of using Benders Decomposition), is there a way to know the boundary of the cause of in-feasibility between adding a new cut in my master problem and the in-feasibility of the problem it self?