I am using pulp to solve a lineal problem in python, I have thousands of constraints, so I can not check each constraints, and my result with some constraints is "Infeasible".
Each restriction has an associated name, how can I know which constraint is not feasible? (In order to fix up the input data or the constraint)
I found this information but the solution code does not work:
How to make solverstudio (pulp and cbc) report out conflict constraints in case of infeasble?
I am using python 3.6 64 bits.